제출 #310735

#제출 시각아이디문제언어결과실행 시간메모리
310735LucaDantasArt Exhibition (JOI18_art)C++17
100 / 100
198 ms8192 KiB
#include<iostream> #include<vector> #include<algorithm> using namespace std; using ll = long long; int main() { ios_base::sync_with_stdio(0), cin.tie(NULL), cout.tie(NULL); int n; cin >> n; vector<pair<ll,ll>> a(n); for(int i = 0; i < n; i++) cin >> a[i].first >> a[i].second; sort(a.begin(), a.end()); vector<ll> comp; ll maior = 0, ans = 0; for(int i = 0; i < n; i++) { maior = max(maior + a[i].second, a[i].second + a[i].first); ans = max(ans, maior - a[i].first); } 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...