| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 1115264 | staszic_ojuz | Art Exhibition (JOI18_art) | C++17 | 1 ms | 336 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#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 time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
