# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
751171 | Nust | Art Exhibition (JOI18_art) | C++17 | 1 ms | 212 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 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 (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... |