| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 95341 | dalgerok | Art Exhibition (JOI18_art) | C++14 | 211 ms | 21132 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<bits/stdc++.h>
#define int long long
using namespace std;
main(){
ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
int n;
cin >> n;
vector < pair < int, int > > q;
for(int i = 1; i <= n; i++){
int x, y;
cin >> x >> y;
q.push_back(make_pair(x, y));
}
sort(q.begin(), q.end());
int ans = 0, sum = 0, mx = 0;
for(int i = 0; i < n; i++){
mx = max(mx, q[i].first - sum);
sum += q[i].second;
ans = max(ans, sum - q[i].first + mx);
}
cout << ans;
}
Compilation message (stderr)
| # | 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... | ||||
