# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
334204 | shahriarkhan | Art Exhibition (JOI18_art) | C++14 | 261 ms | 25064 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 ;
const long long INF = 1e18 ;
int main()
{
int n ;
scanf("%d",&n) ;
vector<pair<long long , long long> > v ;
v.push_back({0,0}) ;
for(int i = 1 ; i <= n ; ++i)
{
long long a , b ;
scanf("%lld%lld",&a,&b) ;
v.push_back({a,b}) ;
}
sort(v.begin(),v.end()) ;
long long pref[n+1] = {0} , ans = -INF , mn = v[1].first ;
for(int i = 1 ; i <= n ; ++i)
{
pref[i] = pref[i-1] + v[i].second ;
}
for(int i = 1 ; i <= n ; ++i)
{
ans = max(ans,pref[i] - v[i].first + mn) ;
mn = max(mn,-pref[i] + v[i+1].first) ;
}
printf("%lld\n",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... |