코드 블럭 테스트~

int solution(vector<int> people, int limit) {
	int answer = 0;

	deque<int> dq(people.begin(), people.end());
	sort(dq.begin(), dq.end());

	while (!dq.empty())
	{
		if (dq.size() <= 1)
			break;

		if (dq.front() + dq.back() <= limit)
			dq.pop_front();

		dq.pop_back();
		answer++;
	}

	answer += dq.size();
	return answer;
}