Submission #1049819

#TimeUsernameProblemLanguageResultExecution timeMemory
1049819vjudge1Art Exhibition (JOI18_art)C++17
50 / 100
1052 ms12124 KiB
#include <bits/stdc++.h>
#define f first
#define s second
using namespace std;
int main() {
    int n;
    cin >> n;
    pair<long long, long long> a[n];long long pref[n+1]; pref[0]=0;
    for(int i=0; i<n; i++){
        cin >> a[i].f >> a[i].s;
    }
    sort(a, a+n);
    for(int i=0; i<n; i++){
        pref[i+1]=pref[i]+a[i].s;
    }
    long long mx=-INT64_MAX;
    for(int i=0; i<n; i++){
        for(int j=i; j<n; j++){
            mx=max(mx, pref[j+1]-pref[i]-a[j].f+a[i].f);
        }
    }
    cout << mx;
    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...