제출 #1049808

#제출 시각아이디문제언어결과실행 시간메모리
1049808vjudge1Art Exhibition (JOI18_art)C++17
0 / 100
1 ms348 KiB
#include <bits/stdc++.h> using namespace std; typedef long long ll; #define pll pair<ll, ll> #define fi first #define se second #define speed ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0); int main() { speed; int n; cin >> n; vector<pll> a(n); int start = 0; bool ok = 1; for(int i = 0; i < n; i++) cin >> a[i].fi >> a[i].se; sort(begin(a), end(a)); for(int i = 0; i < n; i++) { if(a[i].se > a[i].fi && ok) { ok = 0; start = i; } } ll pref[n+1]{}; pref[0] = a[0].se; ll ans = 0ll; for(int i = 1; i < n; i++) pref[i] = a[i].se + pref[i-1]; for(int i = start + 1; i < n; i++) ans = max(ans, pref[i] - (start ? pref[start-1] : 0ll) - (a[i].fi - a[start].fi)); for(int i = 0; i < n; i++) ans = max(ans, a[i].se); 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...