Submission #1212365

#TimeUsernameProblemLanguageResultExecution timeMemory
12123652ia7a8e6a7Art Exhibition (JOI18_art)C++20
0 / 100
0 ms320 KiB
#include <bits/stdc++.h>
using namespace std;
#define int long long
pair<int, int>p[500005];
signed main(){
    int n;
    cin>>n;
    for(int i=1; i<=n; i++){
        cin>>p[i].first>>p[i].second;
    }
    sort(p+1, p+n+1);
    int ans=p[1].second, sum=p[1].second;
    for(int i=2; i<=n; i++){
        sum+=p[i].second;
        ans=max(ans, sum-p[i].first+p[1].first);
    }
    cout<<ans;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...