Submission #716014

#TimeUsernameProblemLanguageResultExecution timeMemory
716014JuanArt Exhibition (JOI18_art)C++17
100 / 100
708 ms8396 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; 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, mx = 0, ans = 0; for(int i = 0; i < n; i++){ sum += v[i].ss; mx = max(mx, -(sum-v[i].ss) +v[i].ff); ans = max(ans, -v[i].ff +sum +mx); } cout << ans << '\n'; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...