11729 Commando War

贪心算法

#include <iostream>
#include <vector>
#include <algorithm>

using namespace std;

struct Job{
    int j,b;
    bool operator < (const Job& x) const {
        if( j == x.j ) return b < x.b;
        return j > x.j;
    }
};

int main(){
    int n,iCase = 0;
    while( cin >> n && n ){
        vector <Job> soldier(n);
        for(int i = 0 ; i < n; i ++ ) cin >> soldier[i].b >> soldier[i].j;
        sort(soldier.begin(),soldier.end());
        int rightB = 0, ans  = 0;
        for( int i = 0; i < n; i ++ ){
            rightB += soldier[i].b;
            ans = max(ans,rightB + soldier[i].j);
        }
        cout<<"Case "<<(++iCase)<<": "<<ans<<endl;
    }
    return 0;
}