Submission #1071901

#TimeUsernameProblemLanguageResultExecution timeMemory
1071901vjudge1Art Exhibition (JOI18_art)C++17
100 / 100
159 ms24916 KiB
#include <bits/stdc++.h>

using namespace std;

#define int long long
#define pb push_back
#define sz(x) x.size()
#define nl '\n'
#define F first
#define S second

const int inf = 1e18;

signed main()
{
    ios_base::sync_with_stdio(0);
    cin.tie(0); cout.tie(0);
    int n;
    cin >>n;
    pair<int, int>a[n + 1];
    int ans = 0, mx = 0, p[n + 1];
    p[0] = 0;
    for( int i = 1; i <= n; ++i )
    {
        cin >>a[i].F >>a[i].S;
        ans = max(ans, a[i].S);
    }
    sort(a + 1, a + n + 1);
    for( int i = 1; i <= n; ++i )
        p[i] = p[i - 1] + a[i].S;
    for( int i = 1; i <= n; ++i )
    {
        ans = max(ans, p[i] - a[i].F + mx);
        mx = max(mx, a[i].F - p[i - 1]);
    }
    cout <<ans;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...