1 solutions
-
1
#include<bits/stdc++.h> using namespace std; const int N=50010; typedef pair<int,int> PII; PII q[N]; int main() { int n; cin>>n; for(int i=0;i<n;i++) { int w,s; cin>>w>>s; q[i]={w+s,w}; } sort(q,q+n); int ans=-2e9; int sum=0; for(int i=0;i<n;i++) { int w=q[i].second,s=q[i].first-w; ans=max(ans,sum-s); sum+=w; } cout<<ans; return 0; }
Information
- ID
- 254
- Time
- 1000ms
- Memory
- 256MiB
- Difficulty
- 5
- Tags
- # Submissions
- 24
- Accepted
- 11
- Uploaded By