Programmers 12982

예산

#include <vector>
#include <algorithm>

using namespace std;

int solution(vector<int> d, int budget)
{
	int answer = 0;

	sort(d.begin(), d.end(), less<int>());

	for (int i = 0; i < d.size(); i++)
	{
		if (budget - d[i] >= 0)
		{
			answer++;

			budget -= d[i];
		}
		else break;
	}

	return answer;
}