Submission #915968

#TimeUsernameProblemLanguageResultExecution timeMemory
915968HorizonWestArt Exhibition (JOI18_art)C++17
100 / 100
140 ms21056 KiB
#include <bits/stdc++.h>
using namespace std;

#define endl '\n'
#define db double
#define ll __int128
#define int long long
#define pb push_back
#define fs first
#define sd second
#define Mod long(1e9 + 7)
#define all(x) x.begin(), x.end()
#define unvisited long(-1)
#define Eps double(1e-9)
#define _for(i, n) for(int i = 0; i < (n); i++)
#define dbg(x) cout << #x ": " << x << endl;

const int Max = 1e6 + 7, Inf = 1e15 + 7;

void print(bool x) { cout << (x ? "YES" : "NO") << endl; }

string tostring (__int128 x)
{
    string ans = "";
    while(x > 0)
    {
        ans += (x % 10 + '0');
        x /= 10;
    }
    reverse(all(ans));
    return ans;
}

void solve()
{
    int n, ans = 0; cin >> n;
    vector <pair<int, int>> v(n);
    for(auto& u : v) cin >> u.fs >> u.sd;
    sort(all(v));

    int sum = 0;

    for(int i = 0; i < n; i++)
    {   
        if(i != 0) sum = max(sum - abs(v[i].fs - v[i-1].fs), 0LL);
        sum += v[i].sd; 
        ans = max(ans, sum);
    }

    cout << ans << endl;
}

int32_t main()
{
    ios_base::sync_with_stdio(0);
    cin.tie(0);

    int Q = 1; //cin >> Q;

    while (Q--)
    {
        solve();
    }

    return 0;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...