Submission #1109196

#TimeUsernameProblemLanguageResultExecution timeMemory
1109196vjudge1Art Exhibition (JOI18_art)C++17
100 / 100
424 ms12120 KiB
# include <bits/stdc++.h>
using namespace std;
long long n;
long long res=0;
long long maxx=INT_MIN,s=0,minn=INT_MAX;
pair<long long, long long> a[500005];
long long t[500005];
int main()
{
    cin >> n;
    s = 0;
    for (long long i = 1; i <= n; i++)
    {
        long long q,p;
        cin >> q >> p;
        a[i]={q,p};
    }
    sort(a+1,a+n+1);
    res = 0;
    for (long long i = 1; i <= n; i++)
    {
        t[i] = t[i-1]+a[i].second;
        minn = min(minn,t[i-1]-a[i].first);
        res = max(res,t[i]-a[i].first-minn);
    }
    cout << res;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...