Submission #1212370

#TimeUsernameProblemLanguageResultExecution timeMemory
12123702ia7a8e6a7Art Exhibition (JOI18_art)C++20
0 / 100
0 ms320 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++){ hmax=max(hmax, f[i].second-f[i].first-dmin); dmin=min(dmin, f[i-1].second-f[i].first); } 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...