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>
#define ll long long
using namespace std;
int main()
{
ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
int N; cin >> N;
vector<pair<ll,ll>> art(N);
for(int i = 0;i<N;++i) cin >> art[i].first >> art[i].second; //first is size, second is value
sort(art.begin(),art.end()); //sort by size
vector<ll> pref(N); pref[0] = art[0].second;
for(int i = 1;i<N;++i) pref[i] = pref[i-1]+art[i].second;
ll ans = 0, cur = art[0].first;
for(int i = 0;i<N;++i){
cur = max(cur,art[i].first-pref[i]);
ans = max(ans,pref[i]-art[i].first+cur);
}
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... |