本文主要是介绍poj-3045 Cow Acrobats,希望对大家解决编程问题提供一定的参考价值,需要的开发者们随着小编来一起学习吧!
题目链接:http://poj.org/problem?id=3045
按weight+strength 排序就行了
#include <iostream>
#include <cstdio>
#include <algorithm>
using namespace std;
typedef struct
{int weight;int stregth;
} COW;
COW cow[50010];
int n;
int cmp(COW a,COW b)
{return a.weight+a.stregth < b.weight+b.stregth;
}
void solve()
{sort(cow,cow+n,cmp);int sum=0,ans=-1000000,risk=0;for(int i=0; i<n; i++){risk=sum-cow[i].stregth;if(risk>ans) ans=risk;sum+=cow[i].weight;}printf("%d\n",ans);
}
int main()
{while(~scanf("%d",&n)){for(int i=0; i<n; i++)scanf("%d%d",&cow[i].weight,&cow[i].stregth);solve();}
}
这篇关于poj-3045 Cow Acrobats的文章就介绍到这儿,希望我们推荐的文章对编程师们有所帮助!