제출 #1205258

#제출 시각아이디문제언어결과실행 시간메모리
1205258yogesh_saneArt Exhibition (JOI18_art)C++20
100 / 100
719 ms8244 KiB
#include <bits/stdc++.h>
using namespace std;
int main() {
    int n;
    cin >> n;
    vector<pair<long long, long long>>art(n);
    for(int i = 0; i < n; i++)
        cin >> art[i].first >> art[i].second;
    sort(art.begin(), art.end());
    long long best = art[0].second, sum = art[0].second;
    for(int i = 1; i < n; i++){
        sum = max(sum+art[i-1].first-art[i].first+art[i].second, art[i].second);
        best = max(best, sum);
    }
    cout << best << '\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...