-
Notifications
You must be signed in to change notification settings - Fork 1
/
02961.cpp
52 lines (45 loc) · 871 Bytes
/
02961.cpp
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
int n;
vector<pair<int, int> > a;
vector<bool> b;
int backtrack(int cnt) {
if (!cnt) {
int sour = 1, bitter = 0;
for (int i=0; i<n; i++) {
if (!b[i]) continue;
sour *= a[i].first;
bitter += a[i].second;
}
return abs(sour - bitter);
}
int ret = 1e9;
for (int i=0; i<n; i++) {
if (b[i]) continue;
b[i] = true;
ret = min(ret, backtrack(cnt-1));
b[i] = false;
}
return ret;
}
void solve(void) {
cin >> n;
a.resize(n);
b.resize(n, false);
for (int i=0; i<n; i++) {
cin >> a[i].first >> a[i].second;
}
int ans = 1e9;
for (int i=1; i<=n; i++) {
ans = min(ans, backtrack(i));
}
cout << ans;
}
int main(void) {
ios::sync_with_stdio(false);
cin.tie(nullptr); cout.tie(nullptr);
solve();
return 0;
}