# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1108360 | vjudge1 | Art Exhibition (JOI18_art) | C++17 | 1047 ms | 4576 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>
#define int long long
using namespace std;
const int N = 1e6 + 5;
int n, a[N], b[N];
int res = 0, c[N];
void check(){
int amin = 1e18;
int amax = 0;
int sum = 0;
int cnt = 0;
for(int i = 1; i <= n; i++){
if(c[i] == 1){
amin = min(a[i], amin);
amax = max(a[i], amax);
sum += b[i];
cnt++;
}
}
if(cnt != 0) res = max(res, sum - (amax - amin));
}
void sinh_np(int i){
for(int j = 0; j <= 1; j++){
c[i] = j;
if(i == n) check();
else sinh_np(i + 1);
}
}
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 >> a[i] >> b[i];
}
sinh_np(1);
cout << res;
}
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... |