This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
using namespace std;
#define int long long
const int INF = 1e18;
pair<int,int> item[500001];
int pref[500001];
signed main()
{
ios_base::sync_with_stdio(false);
cin.tie(0);
int t=1,n;
// cin >> t;
while (t--){
cin >> n;
for (int i = 1; i <= n; i++){
cin >> item[i].first >> item[i].second;
}
sort(item+1,item+n+1);
pref[0] = 0;
for (int i = 1; i <= n; i++){
// cout << item[i].first << " " << item[i].second << "\n";
pref[i] = pref[i-1]+item[i].second;
}
int minm = -INF,ans=0;
for (int i = 1; i <= n; i++){
minm = max(minm, item[i].first-pref[i-1]);
ans = max(ans, minm+pref[i]-item[i].first);
// cout << minm << " " << ans << "\n";
}
cout << ans << "\n";
}
return 0;
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |