# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
196912 | quocnguyen1012 | Art Exhibition (JOI18_art) | C++14 | 262 ms | 24932 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 fi first
#define se second
#define mp make_pair
#define pb push_back
using namespace std;
typedef long long ll;
const int maxn = 5e5 + 5;
pair<ll, ll> pic[maxn];
ll sum[maxn];
int N;
signed main(void)
{
ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
if (fopen("A.INP", "r")){
freopen("A.INP", "r", stdin);
freopen("A.OUT", "w", stdout);
}
cin >> N;
for (int i = 1; i <= N; ++i){
cin >> pic[i].fi >> pic[i].se;
}
sort(pic + 1, pic + 1 + N);
ll Min = 1e18, res = 0;
for (int i = 1; i <= N; ++i){
Min = min(Min, sum[i - 1] - pic[i].fi);
sum[i] = sum[i - 1] + pic[i].se;
res = max(res, sum[i] - pic[i].fi - Min);
}
cout << res << '\n';
}
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... |