Submission #1049767

#TimeUsernameProblemLanguageResultExecution timeMemory
1049767vjudge1Art Exhibition (JOI18_art)C++17
0 / 100
1 ms344 KiB
#include <bits/stdc++.h>

using namespace std;

int main(){
    int num;
    cin >> num;
    
    vector<pair<int, int>> art(num);
    for (int idx = 0; idx < num; idx++){
        cin >> art[idx].first >> art[idx].second; 
    }
    
    sort(art.begin(), art.end());

    long long mxr = LLONG_MIN;
    
    for (int idx = 0; idx < num; idx++) {
        long long smv = 0;
        for(int jdx = idx; jdx < num; jdx++){
            smv += art[jdx].second;
            int amx = art[jdx].first;
            int amn = art[idx].first;
            long long res = smv - (amx - amn);
            mxr = max(mxr, res);
        }
    }
    cout << mxr << endl;

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