#include <algorithm>
#include <vector>
#include <iostream>
using namespace std;
class MutaliskEasy{
public:
bool Pred(int x){
return x <= 0;
}
int minimalAttacks(vector <int> x){
int attack_count = 0;
vector<int>::iterator iter1;
vector<int>::iterator iter2;
vector<int>::iterator iter3;
while (x.size() != 0)
{
if (x.size() == 3){
for (iter2 = x.begin(); iter2 != max_element(x.begin(), x.end()) || iter2 != min_element(x.begin(), x.end()); iter2++);
iter1 = max_element(x.begin(), x.end());
iter3 = min_element(x.begin(), x.end());
*iter1 -= 9;
*iter2 -= 3;
*iter3 -= 1;
attack_count++;
}
else if (x.size() == 2){
iter1 = max_element(x.begin(), x.end());
iter2 = min_element(x.begin(), x.end());
*iter1 -= 9;
*iter2 -= 3;
attack_count++;
}
else{
iter1 = x.begin();
*iter1 -= 9;
attack_count++;
}
remove_if(x.begin(), x.end(), Pred);
}
return attack_count;
}
};
