参加了了两次,上一次写这题得分25,这次66分,有长进哈哈哈。代码如下,思路都在注释里了
#include<iostream>
#include<algorithm>
using namespace std;
int n;
int ans;
struct num
{
int a,b;
int sum;
};
num gavei[105];
int cmp(num a,num b)
{
return a.sum>b.sum;
}
bool Judge(int x)
{
int A=0,B=0;
for(int i=0;i<=x;++i)
{
A+=gavei[i].a;
B+=gavei[i].b;
}
if(A>=0&&B>=0)
return true;
return false;
}
int main()
{
cin>>n;
for(int i=0;i<n;++i)
{
cin>>gavei[i].a>>gavei[i].b;
gavei[i].sum=gavei[i].a+gavei[i].b;
}
sort(gavei,gavei+n,cmp);//降序排列
//定位gavei[i].sum<0;
int rec=n;
for(int i=n-1;i>=0;--i)
{
if(gavei[i].sum<0)
{
rec=i;break;
}
}
//先将这些非零sum全部求和
for(int i=0;i<rec;++i)
ans+=gavei[i].sum;
//倒着来,如果不满足,去掉那一组,满足的话 输出ans return 0
for(int i=rec-1;i>=0;--i)
{
if(Judge(i)==true)
{
cout<<ans<<endl;
return 0;
}
else {
ans-=gavei[i].sum;
}
}
cout<<ans<<endl;
return 0;
}