# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1050102 | 2024-08-09T07:23:21 Z | vjudge1 | Art Exhibition (JOI18_art) | C++ | 0 ms | 348 KB |
#include <bits/stdc++.h> #define f first #define s second using namespace std; int main() { int n; cin >> n; pair<long long, long long> q[n]; for (int i = 0; i < n; i++) { cin >> q[i].f >> q[i].s; } sort(q, q + n); vector<pair<long long, long long>> a; long long s = 0; for (int i = 0; i < n; i++) { if (i > 0 && q[i].f == q[i - 1].f) { s += q[i].s; } else { if (i > 0) { a.push_back(make_pair(q[i - 1].f, s)); } s = q[i].s; } } a.push_back(make_pair(q[n - 1].f, s)); long long m = 0; for (int i = 0; i < a.size(); i++) { long long r = 0; for (int j = i + 1; j < a.size(); j++) { long long s = 0; for (int k = i; k <= j; k++) { s += a[k].s; } r = s - (a[j].f - a[i].f); m = max(m, r); } } cout << m << endl; return 0; }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 0 ms | 348 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 0 ms | 348 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 0 ms | 348 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 0 ms | 348 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |