11729 - Command.o W.ar

题目地址:https://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&page=show_problem&problem=2829

#include<iostream>#include<algorithm>#include<vector>#include<cstdio>using namespace std;struct Job{int b,j;bool operator<(const Job &x)const{return j>x.j;}};int main(void){int n,b,j,ans=0,account=0,count=1;while(scanf("%d",&n)==1&&n){ans=account=0;vector<Job> soldier;for(int i=0;i<n;i++){cin>>b>>j;soldier.push_back((Job){b,j});}sort(soldier.begin(),soldier.end());for(int i=0;i<n;i++){account+=soldier[i].b;ans=max(account+soldier[i].j,ans);}printf("Case %d: %d\n",count++,ans);}return 0;}