拼多多小熊题

加油

并不能通过编译啊

struct animal { int hungry; int battle; }; void eatCandy(vector<animal*> panda, vector<int>& candies) { sort(candies.begin(), candies.end(), greater<int>()); vector<animal*> tmp = panda; auto cmp = [](animal* a1, animal* a2) { return a1->battle > a2->battle; }; sort(tmp.begin(), tmp.end(), cmp); vector<bool> record(candies.size(), false); for(auto animal : tmp) { int j = 0; while(animal->hungry > 0 && j < candies.size()) { if(record[j] == false && animal->hungry >= candies[j]){ animal->hungry -= candies[j]; record[j] = true; } j++; } } } int main() { int numOfPanda; int numOfCandies; while( cin >> numOfPanda >> numOfCandies) { vector<int> candies; vector<animal*> panda; while(numOfCandies--){ int tmp; cin >> tmp; candies.push_back(tmp); } while(numOfPanda--) { animal* a1 = new animal; cin >> a1->battle >> a1->hungry; panda.push_back(a1); } eatCandy(panda, candies); for(auto ani : panda) { cout << ani->hungry << endl; } } return 0; } 报的什么错误呀？

对的呀，代码对的

看楼主的代码写的赏心悦目

int jingshi(vector<int> &candy, int hunger) { for (int i = candy.size() - 1; i >= 0; i--) { if (candy[i] > hunger || candy[i] == -1) continue; else if (hunger >= candy[i]) { hunger = hunger - candy[i]; candy[i] = -1; } } return hunger; } int main() { int n, m; cin >> n >> m; vector<int> candy; for (int i = 0; i < m; i++) { int tmp; cin >> tmp; candy.push_back(tmp); } sort(candy.begin(), candy.end()); vector<vector<int>> hunger; for (int i = 0; i < n; i++) { int tmp1, tmp2; cin >> tmp1; cin >> tmp2; hunger.push_back({ tmp1, tmp2, i }); } sort(hunger.begin(), hunger.end(), [](vector<int> vec1, vector<int> vec2){return vec1[0] > vec2[0];}); for (int i = 0; i < n; i++) { int tmp = hunger[i][1]; int res = jingshi(candy, tmp); hunger[i][1] = res; } sort(hunger.begin(), hunger.end(), [](vector<int> vec1, vector<int> vec2){return vec1[2] < vec2[2]; }); for (int i = 0; i < n; i++) cout << hunger[i][1] << endl; return 0; }