-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathw4_p3.cpp
More file actions
60 lines (48 loc) · 1.37 KB
/
Copy pathw4_p3.cpp
File metadata and controls
60 lines (48 loc) · 1.37 KB
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
53
54
55
56
57
58
59
60
#include <bits/stdc++.h>
using namespace std;
vector<int> bro_flavor(3, 0);
vector<vector<int>> record;
void give_fruit(int idx, vector<int> &fruit, int &min_diff)
{
if (idx == fruit.size())
{
int diff_cur = *max_element(bro_flavor.begin(), bro_flavor.end()) - *min_element(bro_flavor.begin(), bro_flavor.end());
min_diff = min(min_diff, diff_cur);
return;
}
for (int i = 0; i < 3; i++)
{
if (record[i].size() == 3)
continue;
bro_flavor[i] += fruit[idx];
record[i].push_back(fruit[idx]);
give_fruit(idx + 1, fruit, min_diff);
record[i].pop_back();
bro_flavor[i] -= fruit[idx];
}
}
int main()
{
cin.tie(nullptr), ios::sync_with_stdio(false);
record.push_back(vector<int>());
record.push_back(vector<int>());
record.push_back(vector<int>());
int fruit_total = 10;
vector<int> flavor_fruit;
for (int i = 0; i < fruit_total; i++)
{
int flavor;
cin >> flavor;
flavor_fruit.push_back(flavor);
}
int min_diff = INT_MAX;
sort(flavor_fruit.begin(), flavor_fruit.end());
for (int i = 0; i < 10; i++)
{
vector<int> remain = flavor_fruit;
remain.erase(remain.begin() + i);
fill(bro_flavor.begin(), bro_flavor.end(), 0);
give_fruit(0, remain, min_diff);
}
cout << min_diff;
}