# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1118823 | Zflop | Art Exhibition (JOI18_art) | C++14 | 2 ms | 476 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 int long long
const int NMAX = (int)1e5 * 6;
int N;
vector<pair<int,int>>A;
int S[NMAX];
void solve() {
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
cin >> N;
A = vector<pair<int,int>>(N + 1);
for (int i = 1; i <= N;++i)
cin >> A[i].first >> A[i].second;
sort(A.begin() + 1,A.end());
for (int i = 1; i <= N;++i)
S[i] = S[i - 1] + A[i].second;
priority_queue<pair<int,int>>pq;
int ans = 0;
for (int i = 1; i <= N;++i) {
int t = -(A[i].first - A[1].first) + S[i];
if(pq.size()){
auto a = pq.top();
ans = max(ans,t - a.first + A[a.second].second);
}
pq.push({t,i});
}
cout << ans;
}
main() {
solve();
}
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... |