写出式子,风险值就应该等于W总-Wnow-Snow,那么就应该为W总-(Wnow+Snow),然后可以看出要值最小,那么Wnow+Snow应该最大,所以按这个进行排序,然后最大的放最下面即可
#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
#include <cmath>
#include <vector>
using namespace std;
const int INF = 0x3f3f3f3f;
struct node
{
int w,s;
int ws;
}cow[50050];
int n;
bool cmp(node a,node b)
{
return a.ws < b.ws;
}
int main()
{
scanf("%d",&n);
for(int i = 0;i<n;i++)
{
scanf("%d%d",&cow[i].w,&cow[i].s);
cow[i].ws = cow[i].w + cow[i].s;
}
sort(cow,cow+n,cmp);
long long ans = -INF;
long long sum = 0;
for(int i = 0; i < n; i++)
{
ans = max(ans,sum-cow[i].s);
sum += cow[i].w;
}
printf("%I64d\n",ans);
return 0;
}