# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
328210 | MilosMilutinovic | Art Exhibition (JOI18_art) | C++14 | 338 ms | 48392 KiB |
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 ll long long
int main(){
int n;
scanf("%i",&n);
vector<pair<ll,ll>> v(n);
for(int i=0;i<n;i++)scanf("%lld %lld",&v[i].first,&v[i].second);
sort(v.begin(),v.end());
ll pref[n];
for(int i=0;i<n;i++){
if(i==0)pref[i]=v[i].second;
else pref[i]=pref[i-1]+v[i].second;
}
set<ll> s;
ll ans=0;
for(int i=n-1;i>=0;i--){
s.insert(pref[i]-v[i].first);
ll x=0;
if(i>0)x=pref[i-1];
ans=max(ans,*prev(s.end())-x+v[i].first);
}
printf("%lld",ans);
return 0;
}
Compilation message (stderr)
# | 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... |