제출 #1212372

#제출 시각아이디문제언어결과실행 시간메모리
12123722ia7a8e6a7Art Exhibition (JOI18_art)C++20
100 / 100
352 ms8240 KiB
#include <bits/stdc++.h>
using namespace std;
pair<long long, long long>f[500005];
int main(){
    f[0]={0, 0};
    int n;
    long long hmax=-1e9;
    cin>>n;
    for(int i=1; i<=n; i++){
        cin>>f[i].first>>f[i].second;
    }
    sort(f+1, f+n+1);
    for(int i=2; i<=n; i++){
        f[i].second+=f[i-1].second;
    }
    long long dmin=-f[1].first;
    for(int i=1; i<=n; i++){
        dmin=min(dmin, f[i-1].second-f[i].first);
        hmax=max(hmax, f[i].second-f[i].first-dmin);
    }
    cout<<hmax;
    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...