# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
330227 | maximath_1 | Art Exhibition (JOI18_art) | C++11 | 232 ms | 13676 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 <iostream>
#include <vector>
#include <assert.h>
#include <random>
#include <chrono>
#include <iomanip>
#include <algorithm>
#include <set>
#include <queue>
#include <unordered_set>
using namespace std;
#define endl "\n"
#define ll long long
const ll inf = 1e9 + 69;
const int MX = 5e5 + 5;
const int LG = (int)log2(MX);
const ll mod = 1e9 + 7;
const int BLOCK = 450;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
pair<ll, ll> a[MX];
int n; ll ans = -inf * inf, tmp = -inf * inf, sm = -inf * inf;
int main(){
scanf("%d", &n);
for(int i = 1; i <= n; i ++)
scanf("%lld %lld", &a[i].first, &a[i].second);
sort(a + 1, a + n + 1);
for(int i = 1; i <= n; i ++){
tmp = max(tmp, a[i].first - sm);
sm += a[i].second;
ans = max(ans, sm - a[i].first + tmp);
}
printf("%lld\n", 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... |