# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1118830 | 2024-11-26T08:21:16 Z | Zflop | Art Exhibition (JOI18_art) | C++14 | 1 ms | 336 KB |
#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; //cout << A[i].first << ' ' << A[i].second << '\n'; } 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(); //cout << i << ' ' << a.first << ' ' << a.second << '\n'; ans = max(ans,t + a.first); } pq.push({-t + A[i].second,i}); } cout << ans; } main() { solve(); }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 1 ms | 336 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 1 ms | 336 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 1 ms | 336 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 1 ms | 336 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |