Archive 101 Archive 101

#include #include #include #include #include using namespace std; int min_value; int min_index; int solution(vector d, int budget) { int answer = 0; int cur_value = 0; while (d.size()>0) // is_reamin test : { min_value = *min_element(d.begin(), d.end()); min_index = min_element(d.begin(), d.end())-d.begin(); if (cur_value + min_value > budget) { break; } else { cur_value += min_value; answer++; ..