# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
216762 | tushar_2658 | Art Exhibition (JOI18_art) | C++14 | 1096 ms | 24696 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;
const int maxn = 500005;
using ll = long long;
pair<ll, ll> p[maxn];
int main(int argc, char const *argv[])
{
// freopen("in.txt", "r", stdin);
int n;
scanf("%d", &n);
for(int i = 1; i <= n; i++){
scanf("%lld %lld", &p[i].first, &p[i].second);
}
sort(p + 1, p + n + 1);
vector<ll> pref(n + 1);
for(int i = 1; i <= n; i++){
pref[i] = pref[i - 1] + p[i].second;
}
ll ans = -1e18;
for(int i = 1; i <= n; i++){
for(int j = 1; j < i; j++){
ans = max(ans, (pref[i] - pref[j - 1]) - p[i].first + p[j].first);
}
ans = max(ans, pref[i] - pref[i - 1]);
}
cout << ans << endl;
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... |