#include <bits/stdc++.h>
using namespace std;
int n;
pair<long long, long long> p[(int)5e5 + 10];
long long pref[(int) 5e5 + 10];
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
cin >> n;
for (int i = 1; i <= n; i++) {
cin >> p[i].first >> p[i].second;
}
sort(p + 1, p + n + 1);
long long ans = 0;
for (int mask = 1; mask < (1 << n); mask++) {
long long mx = 0, mn = LLONG_MAX, sum = 0;
for (int i = 0; i < n; i++) {
if ((mask >> i) & 1) {
mx = max(mx, p[i + 1].first);
mn = min(mn, p[i + 1].first);
sum += p[i + 1].second;
}
}
ans = max(ans, sum - mx + mn);
}
cout << ans;
return 0;
}
# | 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... |