m0_51363075的博客

#include<iostream>using namespace std;int main(){ int n; cin>>n; int* tone = new int[n + 1]; for(int i = 0; i <= n; i++){ cin>>tone[i]; } int* path = new int[n + 1]; if(n == 1) { .

1020 月饼## 找不到测试点这里是引用23分卡点：没有考虑到 需求可能大于总的库存的情况以下代码为满分代码#include#include#includeusing namespace std;class goods{public:double store;double price;double rate(){return price/store;}};bool cmp(goods a ,goods b);int main(){int sum_kind ;int