# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
252621 | ChrisT | Art Exhibition (JOI18_art) | C++17 | 288 ms | 21112 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;
int main () {
int n;
scanf ("%d",&n);
vector<pair<long long, long long>> v(n+1);
for (int i = 1; i <= n; i++) scanf ("%lld %lld",&v[i].first,&v[i].second);
sort(v.begin()+1,v.end());
long long mx = -1e18, ret = -1e18;
for (int i = 1; i <= n; i++) {
v[i].second += v[i-1].second;
mx = max(mx,v[i].first - v[i-1].second);
ret = max(ret,v[i].second - v[i].first + mx);
}
printf ("%lld\n",ret);
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... |