Submission #1115264

#TimeUsernameProblemLanguageResultExecution timeMemory
1115264staszic_ojuzArt Exhibition (JOI18_art)C++17
0 / 100
1 ms336 KiB
#include <iostream> #include <vector> #include <algorithm> using namespace std; int main() { int64_t n; cin >> n; vector<pair<int64_t,int64_t>> ob(n); for (int64_t i=0; i<n; i++) cin >> ob[i].first >> ob[i].second; sort(ob.begin(),ob.end()); int64_t wyn=ob[0].second,ost=ob[0].first; for (int i=1; i<n; i++){ //cout << wyn << '\n'; if (ob[i].second+ost-ob[i].first>=0){ wyn+=ob[i].second+ost-ob[i].first; ost=ob[i].first; } else ost+=ob[i].second; } cout << wyn; 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...