Submission #1115342

#TimeUsernameProblemLanguageResultExecution timeMemory
1115342staszic_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 (int i=0; i<n; i++) cin >> ob[i].first >> ob[i].second; sort(ob.begin(),ob.end()); //vector<int64_t> wyn={ob[0].second}; //cout << wyn[0] << ' ' << ob[0].first << '\n'; int64_t aktwyn=ob[0].second, ost=ob[0].first; for (int i=1; i<n; i++){ //wyn.push_back(wyn[i-1]+ob[i].first); if (ob[i].second>aktwyn and ob[i].second>aktwyn+ob[i].second+ost-ob[i].first){ ost=ob[i].first; aktwyn=ob[i].second; } else if (ob[i].second+ost-ob[i].first>0){ aktwyn+=ob[i].second+ost-ob[i].first; ost=ob[i].first; } else{ ost+=ob[i].second; } //cout << wyn[i] << ' ' << ob[i].first << '\n'; } cout << aktwyn; 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...