//使用优先队列
include[HTML_REMOVED]
using namespace std;
struct wmy {
int price;
int date;
} a[10000];
bool cmp(wmy a,wmy b) {
return a.date[HTML_REMOVED],greater[HTML_REMOVED]>heap;
for(i=0; i<n; i++) {
heap.push(a[i].price);
if(a[i].date<heap.size())
heap.pop();
}
while(!heap.empty()) {
sum=sum+heap.top();
heap.pop();
}
printf(“%d\n”,sum);
}
return 0;
}
牛逼大佬