#include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n;
cin >> n;
vector<pair<long long , long long>> a(n);
for (int i = 0 ; i < n ; i++) {
cin >> a[i].first >> a[i].second;
}
long long ans = 0;
for (int i = 0 ; i < (1 << n) ; i++) {
long long S = 0;
long long Max = 0;
long long Min = (long long)1e18;
for (int j = 0 ; j < n ; j++) {
if (i & (1 << j)) {
S += a[j].second;
Max = max(a[j].first , Max);
Min = min(a[j].first , Min);
}
}
if (S) ans = max(ans , S + Min - Max);
}
cout << ans << '\n';
return 0;
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
5 ms |
212 KB |
Output is correct |
2 |
Correct |
5 ms |
324 KB |
Output is correct |
3 |
Correct |
4 ms |
324 KB |
Output is correct |
4 |
Correct |
4 ms |
320 KB |
Output is correct |
5 |
Correct |
5 ms |
324 KB |
Output is correct |
6 |
Correct |
4 ms |
212 KB |
Output is correct |
7 |
Correct |
5 ms |
212 KB |
Output is correct |
8 |
Correct |
5 ms |
212 KB |
Output is correct |
9 |
Correct |
4 ms |
212 KB |
Output is correct |
10 |
Correct |
5 ms |
320 KB |
Output is correct |
11 |
Correct |
6 ms |
320 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
5 ms |
212 KB |
Output is correct |
2 |
Correct |
5 ms |
324 KB |
Output is correct |
3 |
Correct |
4 ms |
324 KB |
Output is correct |
4 |
Correct |
4 ms |
320 KB |
Output is correct |
5 |
Correct |
5 ms |
324 KB |
Output is correct |
6 |
Correct |
4 ms |
212 KB |
Output is correct |
7 |
Correct |
5 ms |
212 KB |
Output is correct |
8 |
Correct |
5 ms |
212 KB |
Output is correct |
9 |
Correct |
4 ms |
212 KB |
Output is correct |
10 |
Correct |
5 ms |
320 KB |
Output is correct |
11 |
Correct |
6 ms |
320 KB |
Output is correct |
12 |
Incorrect |
4 ms |
212 KB |
Output isn't correct |
13 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
5 ms |
212 KB |
Output is correct |
2 |
Correct |
5 ms |
324 KB |
Output is correct |
3 |
Correct |
4 ms |
324 KB |
Output is correct |
4 |
Correct |
4 ms |
320 KB |
Output is correct |
5 |
Correct |
5 ms |
324 KB |
Output is correct |
6 |
Correct |
4 ms |
212 KB |
Output is correct |
7 |
Correct |
5 ms |
212 KB |
Output is correct |
8 |
Correct |
5 ms |
212 KB |
Output is correct |
9 |
Correct |
4 ms |
212 KB |
Output is correct |
10 |
Correct |
5 ms |
320 KB |
Output is correct |
11 |
Correct |
6 ms |
320 KB |
Output is correct |
12 |
Incorrect |
4 ms |
212 KB |
Output isn't correct |
13 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
5 ms |
212 KB |
Output is correct |
2 |
Correct |
5 ms |
324 KB |
Output is correct |
3 |
Correct |
4 ms |
324 KB |
Output is correct |
4 |
Correct |
4 ms |
320 KB |
Output is correct |
5 |
Correct |
5 ms |
324 KB |
Output is correct |
6 |
Correct |
4 ms |
212 KB |
Output is correct |
7 |
Correct |
5 ms |
212 KB |
Output is correct |
8 |
Correct |
5 ms |
212 KB |
Output is correct |
9 |
Correct |
4 ms |
212 KB |
Output is correct |
10 |
Correct |
5 ms |
320 KB |
Output is correct |
11 |
Correct |
6 ms |
320 KB |
Output is correct |
12 |
Incorrect |
4 ms |
212 KB |
Output isn't correct |
13 |
Halted |
0 ms |
0 KB |
- |