Submission #1066984

#TimeUsernameProblemLanguageResultExecution timeMemory
1066984SzymonKrzywdaArt Exhibition (JOI18_art)C++17
100 / 100
346 ms21032 KiB
#include <bits/stdc++.h> using namespace std; int main() { long long n,a,b; cin >> n; vector<pair<long long, long long>> tab(0); for (int i=0; i<n; i++){ cin >> a >> b; tab.push_back({a,b}); } sort(tab.begin(),tab.end()); long long wynik = 0; long long pop = tab[0].first; long long akt_wynik = 0; for (auto [i_1,i_2] : tab){ akt_wynik = max(akt_wynik-(i_1-pop)+i_2,i_2); pop = i_1; wynik = max(wynik,akt_wynik); } cout << wynik << endl; return 0; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...