| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 1034040 | vjudge1 | Art Exhibition (JOI18_art) | C++17 | 0 ms | 348 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 endl "\n"
using namespace std;
#define ll long long
#define S second
#define F first
int main()
{
int n;
scanf("%d", &n);
vector<pair<ll, ll> > q;
for(int i = 0; i < n; ++i)
{
ll a, b;
scanf("%lld %lld", &a, &b);
q.push_back({a, b});
}
sort(q.begin(), q.end());
ll ans = -1;
ll cur = q[0].S;
ll check = q[0].S;
for(int i = 1; i < n; ++i)
{
cur += q[i].S - (q[i].F - q[0].F);
if(i > 1){ cur += (q[i - 1].F - q[0].F); }
ans = max(ans, cur);
check = max(check, q[i].S);
}
printf("%lld", max(ans, max(check, (ll)0)));
}
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... | ||||
