Problem: 1705. 吃苹果的最大数目堆优先队列堆首保存腐败时间和剩下的苹果每次吃最先腐败的苹果后腐败后吃的等n日过去以后就可以根据时间和苹果来判断吃完还是扔掉一部分吃完时间只需要累加苹果数量扔掉一部分时间到了最晚的Codeusing pr pairint, int; class Solution { public: int eatenApples(vectorint apples, vectorint days) { priority_queuepr, vectorpr, decltype(greaterpr()) pq; int n apples.size(), sum 0, num, deadline; for(int i 0; i n; i) { pq.push({days[i] i, apples[i]}); while(!pq.empty() pq.top().first i) pq.pop(); if(!pq.empty()) { sum 1; num pq.top().second; deadline pq.top().first; num--; pq.pop(); if(num ! 0) pq.push({deadline, num}); } } int now n; while(!pq.empty()) { if(pq.top().first - now pq.top().second) { sum pq.top().first - now; now pq.top().first; } else { sum pq.top().second; now pq.top().second; } pq.pop(); } return sum; } };