C++ / 구명보트

Problem

난이도 : 프로그래머스 2단계 68%

분류 : Greedy

 

Solution

#include <string>
#include <vector>
#include <algorithm>
#include <iostream>
using namespace std;

int solution(vector<int> people, int limit) {
    int answer = 0;
    sort(people.begin(),people.end(),greater<int>());
    int left = 0;
    int right = people.size() - 1;
    while(left <= right){
        while(people[left] + people[right] > limit && left <= right){
            left++;
            answer++;
        }
        if(left <= right){
            right--;
            left++;
            answer++;
        }
    }
    return answer;
}