问题标题: 酷町堂：3681

#include <iostream>

#include <algorithm>

using namespace std;

struct nd

{

int w,s;

}a[50005];

bool cmp(nd x,nd y)

{

if(x.s!=y.s)

{

return x.s<y.s;

}

return x.w>y.w;

}

int main()

{

int n;

cin>>n;

for(int i=1;i<=n;i++)

{

cin>>a[i].w>>a[i].s;

//cout<<a[i].w<<' '<<a[i].s<<endl;

}

sort(a+1,a+n+1,cmp);

int maxn=-1000000;

for(int i=1;i<=n;i++)

{

//cout<<a[i].w<<' '<<a[i].s<<endl;

//cout<<a[i].w<<endl;

int qb=0;

for(int j=1;j<i;j++)

{

// cout<<a[j].w<<' ';

qb+=a[j].w;

}

//cout<<endl;

qb-=a[i].s;

if(qb>maxn)

{

maxn=qb;

}

}

cout<<maxn;

}