제출 #1273193

#제출 시각아이디문제언어결과실행 시간메모리
1273193arkanefuryArt Exhibition (JOI18_art)C++20
0 / 100
0 ms332 KiB
#include <bits/stdc++.h> #define sz size() #define FOR(x, n, m, d) for(int x = n; x <= m; x += d) #define all(v) v.begin(), v.end() #define S second #define F first #define pb push_back #define int long long using namespace std; const int N = 5e5+5; int a[N], b[N], c[N], n, l, ans, k; signed main(){ cin >> n; vector<pair<int, int>>v; FOR(i, 1, n, 1)cin >> a[i] >> b[i], v.pb({a[i], b[i]}); sort(all(v)); ans = 0; int lst = 0; k = 1; l = 0; int cnt = 0; for(auto i : v){ ans -= (i.F - lst); ans += i.S; c[k] += c[k-1] + i.S; if(i.F - l - c[k-1] >= 0)ans += i.F - l - c[k-1], l = i.F; k ++; lst = i.F; cnt = max(cnt, ans); } cout << cnt; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...