제출 #704448

#제출 시각아이디문제언어결과실행 시간메모리
704448GrandTiger1729Art Exhibition (JOI18_art)C++17
50 / 100
1099 ms19920 KiB
#include <iostream>
#include <algorithm>
using namespace std;

const long long INF = 1e18;
int main(){
    cin.tie(0)->sync_with_stdio(0);
    int n; cin >> n;
    pair<long long, long long> a[n];
    for (int i = 0; i < n; i++)
        cin >> a[i].first >> a[i].second;
    sort(a, a + n);
    long long pref[n + 1]{};
    for (int i = 0; i < n; i++)
        pref[i + 1] = pref[i] + a[i].second;
    long long ans = -INF;
    for (int i = 0; i < n; i++){
        for (int j = i; j < n; j++){
            ans = max(ans, pref[j + 1] - pref[i] - (a[j].first - a[i].first));
        }
    }
    cout << ans << '\n';
    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...