# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
751171 | 2023-05-31T07:14:14 Z | Nust | Art Exhibition (JOI18_art) | C++17 | 1 ms | 212 KB |
#include <bits/stdc++.h> using namespace std; #define ll long long const ll INF = 1e16; using namespace std; int main(){ ll len, n, s, wmax, wmin, input1, input2, biggest = 0, value; vector<pair<ll, ll>> arr; pair<ll, ll> arrtemp; cin >> n; for(int i = 0; i < n; i++){ cin >> input1 >> input2; arrtemp.first = input1; arrtemp.second = input2; arr.push_back(arrtemp); } sort(arr.begin(), arr.end()); for(int i = 1; i <= n; i++){ s = 0; wmax = 0; wmin = INF; for(int j = 0; j < i; j++){ wmax = max(wmax, arr[j].first); wmin = min(wmin, arr[j].first); s += arr[j].second; } value = s - abs(wmax-wmin); biggest = max(biggest, value); } cout << biggest; }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 1 ms | 212 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 1 ms | 212 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 1 ms | 212 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 1 ms | 212 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |