# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
64046 | patrikpavic2 | Art Exhibition (JOI18_art) | C++17 | 370 ms | 34188 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 <cstdio>
#include <vector>
#include <set>
#include <algorithm>
#define X first
#define Y second
using namespace std;
typedef long long ll;
typedef pair < ll , ll > pii;
const int N = 1e5 + 500;
vector < pii > v;
set < pii > s;
ll sol = 0, pref[N];
int n;
int main(){
scanf("%d", &n);
for(int i = 0;i<n;i++){
ll x, y;scanf("%lld%lld", &x, &y);
v.push_back({x, y});
}
sort(v.rbegin(), v.rend());
for(int i = 0;i<n;i++){
pref[i] = (i ? pref[i - 1] : 0) + v[i].Y;
}
for(int i = 0;i<n;i++){
s.insert({pref[i] + v[i].X, i});
}
for(int i = 0;i<n;i++){
sol = max(sol, (s.rbegin()->X) - (i ? pref[i - 1] : 0) - v[i].X);
s.erase({pref[i] + v[i].X, i});
}
printf("%lld\n", sol);
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... |