大白书 第三页

#include <iostream>#include <vector>#include <algorithm>using namespace std;struct job{    int b;    int j;};bool cmp(job a,job b){    return a.j>b.j;}void in(job &s){    cin>>s.b>>s.j;}void show(job s){    cout<<s.b<<' '<<s.j<<endl;}int main(){    job s[1000];    int n;    while(cin>>n)    {        int i;        for(i=0;i<n;i++) in(s[i]);        sort(s,s+n,cmp);        cout<<endl;        for(i=0;i<n;i++) show(s[i]);        int x=0,y=0;        for(i=0;i<n;i++)        {            x+=s[i].b;            y=max(y,x+s[i].j);        }        cout<<y<<endl;    }    return 0;}