Submission #623414

#TimeUsernameProblemLanguageResultExecution timeMemory
623414kkkkkkkkArt Exhibition (JOI18_art)C++14
50 / 100
1061 ms24696 KiB

#include <bits/stdc++.h>

using namespace std;

int main()
{
    int n;
    cin >> n;
    vector<pair<long long,long long> > v(n+1);
    for (int i=1;i<=n;i++)
        cin >> v[i].first >> v[i].second;
    sort(v.begin(),v.end());
    long long prefsum[n+1];
    prefsum[0]=0;
    for (int i=1;i<=n;i++)
        prefsum[i]=prefsum[i-1]+v[i].second;
    long long vk=0;
    for (int i=1;i<=n;i++)
    {
        for (int j=i;j<=n;j++)
            vk=max(vk,(prefsum[j]-prefsum[i-1])-(v[j].first-v[i].first));
    }
    cout << vk;

    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...