Submission #1037456

#TimeUsernameProblemLanguageResultExecution timeMemory
1037456ArthuroWichArt Exhibition (JOI18_art)C++17
100 / 100
391 ms45172 KiB
#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 timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...