uva11729 Commando War<贪心>

链接:http://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&page=show_problem&problem=2829

#include <iostream>
#include <cstdio>
#include <string>
#include <cstring>
#include <cmath>
#include <vector>
#include <algorithm>
using namespace std;
int N;

class Node
{
    public:
        int s, e;
        bool operator <( const Node x ) const{
            return e>x.e;    
        }
};

int main( )
{
    int Case=1, s, e;
    while( scanf( "%d", &N )!= EOF, N ){
        cout<< "Case "<<Case++<<": ";
        vector<Node>v;
        for( int i=0; i<N; ++ i ){
            cin>>s>>e;
            v.push_back((Node){s, e} );    
        }
        sort( v.begin(), v.end() );
        int ans=0, s=0;
        for( int i=0; i<N; ++ i ){
            s+=v[i].s;
            ans=max( ans, s+v[i].e );
        }
        cout<<ans<<endl;
    }
    return 0;
}

#include <iostream>
#include <cstdio>
#include <string>
#include <cstring>
#include <cmath>
#include <vector>
#include <algorithm>
using namespace std;
struct Node
{
    int a, b;
}p[100000];
bool cmp( const Node &x, const Node &y )
{
    return y.b<x.b;    
}
int main( )
{
    int N, Case=1;
    while( scanf("%d", &N )==1, N ){
        printf( "Case %d: ", Case++ );
        for( int i=0; i<N; ++ i ){
            scanf( "%d%d", &p[i].a, &p[i].b );
        }    
        sort( p, p+N, cmp );
        int ans=0, s=0;
        for( int i=0; i<N; ++ i ){
            s+=p[i].a;
            ans=max( ans, s+p[i].b );
        }
        printf("%d\n", ans );
    }
}