POJ 2786 Keep the Customer Satisfied 优先队列
2014-01-08 23:01
357 查看
----------
----------
const int maxn=900000; const int maxm=10000; int n; struct Dat{ int v,lim; const bool operator<(const Dat& rhs) const{ return v<rhs.v; } }a[maxn]; bool cmp(Dat a,Dat b){ return a.lim<b.lim; } priority_queue<Dat>que; int main(){ while (~scanf("%d",&n)){ for (int i=0;i<n;i++) scanf("%d%d",&a[i].v,&a[i].lim); sort(a,a+n,cmp); int sum=0; int ans=0; while (!que.empty()) que.pop(); for (int i=0;i<n;i++){ que.push(a[i]); sum+=a[i].v; while (sum>a[i].lim){ Dat top=que.top(); que.pop(); sum-=top.v; ans++; } } printf("%d\n",n-ans); } return 0; }
----------
相关文章推荐
- POJ 2786 Keep the Customer Satisfied 优先队列
- poj 2786 Keep the Customer Satisfied(贪心+优先队列)
- Keep the Customer Satisfied poj 2786
- 【POJ】2786-Keep the Customer Satisfied(贪心 + 优先队列,姿势不对就要跪)
- UVa 1153 Keep the Customer Satisfied (贪心+优先队列)
- UVA 1153 Keep the Customer Satisfied(贪心+优先队列)
- UVa 1153 Keep the Customer Satisfied (贪心+优先队列)
- UVa 1153 - Keep the Customer Satisfied (贪心 + 优先队列)
- UVA1153-Keep the Customer Satisfied(贪心+优先队列)
- 1153 - Keep the Customer Satisfied(贪心+优先队列)
- uva 1153 - Keep the Customer Satisfied(贪心+优先队列)
- uva 1613 Keep the Customer Satisfied
- UVA 1153 - Keep the Customer Satisfied
- uva uva 1153 - Keep the Customer Satisfied
- UVALive - 3507 Keep the Customer Satisfied 贪心
- UVA - 1153 Keep the Customer Satisfied
- 1153 - Keep the Customer Satisfied(贪心)
- UVA 1153 Keep the Customer Satisfied 顾客是上帝(贪心)
- UVALive 3507:Keep the Customer Satisfied(贪心 Grade C)
- UVA 1153 - Keep the Customer Satisfied(贪心)