Submission #926619

#TimeUsernameProblemLanguageResultExecution timeMemory
926619VMaksimoski008Art Exhibition (JOI18_art)C++14
100 / 100
407 ms8272 KiB
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
 
int main() {
    int n, i;
    cin >> n;
 
    vector<array<ll, 2> > v(n+1);
    for(i=1; i<=n; i++) cin >> v[i][0] >> v[i][1];
    sort(v.begin()+1, v.end());
 
    ll A = 0, M = -1e18, S = 0;
    for(i=1; i<=n; i++) {
        M = max(M, v[i][0] - S);
        S += v[i][1];
        A = max(A, S - v[i][0] + M);
    }
 
    cout << A << '\n';
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...