제출 #310733

#제출 시각아이디문제언어결과실행 시간메모리
310733LucaDantasArt Exhibition (JOI18_art)C++17
0 / 100
0 ms256 KiB
#include<iostream> #include<vector> #include<algorithm> using namespace std; int main() { int n; cin >> n; vector<pair<int,int>> a(n); for(int i = 0; i < n; i++) cin >> a[i].first >> a[i].second; sort(a.begin(), a.end()); vector<int> comp; int 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...