#include<iostream>
#include<algorithm>
using namespace std;
struct node{
int a,b;
}a[50010];
bool cmp(node x,node y){
return x.a+x.b<=y.a+y.b;
}
int n;
int main(){
cin>>n;
for(int i=0;i<n;i++){
cin>>a[i].a>>a[i].b;
}
sort(a,a+n,cmp);
long long maxx=-1e15,sum=0;
for(int i=0;i<n;i++){
long long t=sum-a[i].b;
maxx=max(maxx,t);
sum+=a[i].a;
}
cout<<maxx;
}
耍杂技的牛
最新推荐文章于 2024-07-15 13:32:43 发布