# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1076118 | lmaobruh | Art Exhibition (JOI18_art) | C++14 | 1 ms | 348 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 ii pair<long long, long long>
#define fi first
#define se second
const int N = 5e5+5;
int n;
ii a[N];
bool cmp(ii p1, ii p2) {
if (p1 == p2) return 0;
else if (p1 != p2) return p1.fi < p2.fi;
else return p1.se > p2.se;
}
int main() {
cin.tie(0)->sync_with_stdio(0);
if (fopen("A.inp", "r"))
freopen("A.inp", "r", stdin);
cin >> n;
for (int i = 1; i <= n; ++i)
cin >> a[i].fi >> a[i].se;
sort(a+1, a+n+1, cmp);
long long ans = a[1].se, mx = 0;
for (int i = 1; i <= n; ++i) {
ans = max(ans, mx - a[i].fi + a[i].se);
mx = max(mx + a[i].se, a[i].fi + a[i].se);
}
cout << ans;
}
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... |