[BZOJ1629&&Usaco07Demo] Cow Acrobats

题解：贪心出奇迹

#include <iostream>#include <cstdio>#include <climits>#include <algorithm>using namespace std;#define INF INT_MAXint n,tot=-INF,sum;struct cow{    int w,p;}c[50005];bool cmp(cow a,cow b){    return a.w+a.p<b.w+b.p;} void init(){    cin>>n;    for(int i=1;i<=n;i++)    scanf("%d%d",&c[i].w,&c[i].p);    sort(c+1,c+1+n,cmp);}void work(){    for(int i=1;i<=n;i++)    {        tot=max(tot,sum-c[i].p);        sum+=c[i].w;    }    printf("%d\n",tot);}int main(){    init();    work();}