Submission #523146

#TimeUsernameProblemLanguageResultExecution timeMemory
523146Jarif_RahmanArt Exhibition (JOI18_art)C++17
100 / 100
204 ms20676 KiB
#include <bits/stdc++.h>
#define pb push_back
#define f first
#define sc second
using namespace std;
typedef long long int ll;
typedef string str;
int main(){
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    int n; cin >> n;

    ll ans = 0, mx = 0;

    vector<pair<ll, ll>> v(n);
    for(auto &p: v) cin >> p.f >> p.sc, ans = max(ans, p.sc);
    sort(v.begin(), v.end());

    for(int i = 1; i < n; i++){
        ll x = v[i-1].sc-(v[i].f-v[i-1].f);
        mx = max(mx+x, x);
        ans = max(ans, mx+v[i].sc);
    }

    cout << ans << "\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...