# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1108356 | 2024-11-04T01:13:28 Z | vjudge1 | Art Exhibition (JOI18_art) | C++17 | 1 ms | 2384 KB |
#include<bits/stdc++.h> using namespace std; const int N = 1e6 + 5; int n; pair<int, int> item[N]; int p[N]; int32_t main(){ ios_base::sync_with_stdio(0); cin.tie(0);cout.tie(0); #define Task "Flower" if(fopen(Task".inp","r")){ freopen(Task".inp","r",stdin); freopen(Task".out","w",stdout); } cin >> n; for(int i = 1; i <= n; i++){ cin >> item[i].first >> item[i].second; } sort(item + 1, item + n + 1); for(int i = 1; i <= n; i++){ p[i] = p[i - 1] + item[i].second; } int res = 0; for(int i = 1; i <= n; i++){ res = max(res, p[i] + item[1].first - item[i].first); } cout << res; }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 1 ms | 2384 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 1 ms | 2384 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 1 ms | 2384 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 1 ms | 2384 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |