Submission #715801

#TimeUsernameProblemLanguageResultExecution timeMemory
715801JuanArt Exhibition (JOI18_art)C++17
0 / 100
0 ms212 KiB
#include<bits/stdc++.h> using namespace std; #define int long long #define pii pair<int, int> #define ff first #define ss second const int maxn = 5e5 + 5, INF = 0x3f3f3f3f3f3f3f3f; pii v[maxn]; int32_t main(){ int n; cin >> n; for(int i = 0; i < n; i++) cin >> v[i].ff >> v[i].ss; sort(v, v+n); int sum = 0, mn = INF, ans = 0; for(int i = 0; i < n; i++){ sum += v[i].ss; if(i) ans = max(ans, sum - (v[i].ff - mn)); mn = min(mn, sum-v[i].ss+v[i].ff); } 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...