제출 #1288873

#제출 시각아이디문제언어결과실행 시간메모리
1288873AbdullahIshfaqArt Exhibition (JOI18_art)C++20
100 / 100
138 ms8264 KiB
#include <bits/stdc++.h> using namespace std; #define ll long long #define MOD 998244353 ll i, n, a, A; pair<ll, ll> p[500005]; void solve() { cin >> n; for (i = 1; i <= n; i++) cin >> p[i].first >> p[i].second; sort(p + 1, p + n + 1); for (i = 1; i <= n; i++) A = max(A, a + p[i].second), a += p[i].first + p[i].second - p[i + 1].first, a *= (a > 0); cout << A; } int main() { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); ll t = 1; // cin >> t; for (int i = 1; i <= t; i++) { solve(); } }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...