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 int long long int
void solve() {
int n, ans = 0;
cin >> n;
map<int, int> co;
vector<pair<int, int>> a;
for (int i = 0; i < n; i++) {
int x, v;
cin >> x >> v;
co[x] += v;
}
for (auto c : co) {
a.push_back(c);
}
n = a.size();
int s = 0, mn = -1e14;
for (int i = 0; i < n; i++) {
mn = max(mn, a[i].first-s);
s += a[i].second;
ans = max(ans, s+mn-a[i].first);
}
cout << ans << endl;
}
int32_t main() {
ios::sync_with_stdio(0);
cin.tie(0);
int t;
t = 1;
while(t--) {
solve();
}
}
# | 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... |