Submission #257934

#TimeUsernameProblemLanguageResultExecution timeMemory
257934FidiskArt Exhibition (JOI18_art)C++14
100 / 100
811 ms21116 KiB
#include <bits/stdc++.h>
using namespace std;

long long n,i,res,cur;
pair<long long,long long> a[500009];

int main() {
    cin>>n;
    for (i=1;i<=n;i++) {
        cin>>a[i].first>>a[i].second;
    }
    sort(a+1,a+n+1);
    res=a[1].second;
    cur=res;
    for (i=2;i<=n;i++) {
        cur=max(cur-a[i].first+a[i-1].first+a[i].second,a[i].second);
        res=max(cur,res);
    }
    cout<<res;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...