# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
48457 | arman_ferdous | Art Exhibition (JOI18_art) | C++17 | 9 ms | 716 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;
typedef long long ll;
const int N = 5e5+10;
pair<ll,ll> arr[N];
void brute(int n) {
ll ans = 0;
for(int mask = 1; mask < (1<<n); mask++) {
ll sum = 0, mini = (ll)1e18, maxi = (ll)-1e18;
for(int i = 0; i < n; i++)
if(mask>>i&1) {
sum += arr[i].second;
mini = min(mini, arr[i].first);
maxi = max(maxi, arr[i].first);
}
ans = max(ans, sum - maxi + mini);
}
cout << endl << ans << endl;
}
int main() {
int n;
scanf("%d", &n);
for(int i = 0; i < n; i++)
scanf("%lld %lld", &arr[i].first, &arr[i].second);
/*
sort(arr,arr+n);
ll ans = 0, sum = 0;
for(int i = 0; i < n; i++) {
sum += arr[i].second;
ans = max(ans, sum - arr[i].first + arr[0].first);
}
printf("%lld", ans);*/
brute(n);
return 0;
}
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... |