# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1108393 | vjudge1 | Art Exhibition (JOI18_art) | C++17 | 1 ms | 2384 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>
using namespace std;
#define ll long long
#define FOR(i, a, b) for(int i = (a); i <= (b); i++)
#define FORD(i, b, a) for(int i = (b); i >= (a); i--)
#define pa pair<ll, ll>
#define fi first
#define se second
#define bit(mask, j) (mask & (1<<j))
const ll mod = 1e9 + 7;
const ll INF = 1e17;
const ll N = 5e5 + 10;
pa a[N];
ll s[N], ans = 0;
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);cout.tie(0);
#define NAME "hbmt"
if(fopen(NAME".inp", "r")) {
freopen(NAME".inp", "r", stdin);
freopen(NAME".out", "w", stdout);
}
ll n;
cin >> n;
FOR(i, 1, n)
{
cin >> a[i].fi >> a[i].se;
}
sort(a + 1, a + n + 1);
FOR(i, 1, n)
{
s[i] = s[i - 1] + a[i].se;
}
FOR(i, 1, n)
{
ll res = s[i] - a[i].fi + a[1].fi;
ll res2 = s[n] - s[i - 1] - a[n].fi + a[i].fi;
ans = max({ans, res, res2});
}
cout << ans;
return 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... |