[Programmers] (탐욕법(Greedy)) Lv 2. 구명보트

https://school.programmers.co.kr/learn/courses/30/lessons/42885

프로그래머스

 

#include <string>
#include <vector>
#include <algorithm>

using namespace std;

int solution(vector<int> people, int limit) {
    int answer = 0;
    int leftPointer = 0, rightPointer = people.size() - 1;

    sort(people.begin(), people.end());
    
    // 투포인터 방식
    while (leftPointer <= rightPointer)
    {
        if (people[leftPointer] + people[rightPointer] <= limit)
            ++leftPointer;

        --rightPointer;
        ++answer;
    }
    return answer;
}

GitHub : https://github.com/developeSHG/Algorithm-Baekjoon_Programmers/blob/3dcbf030d56135b06149e29f5e2c7f8b0d2c8f5b/%ED%94%84%EB%A1%9C%EA%B7%B8%EB%9E%98%EB%A8%B8%EC%8A%A4/lv2/42885.%E2%80%85%EA%B5%AC%EB%AA%85%EB%B3%B4%ED%8A%B8/%EA%B5%AC%EB%AA%85%EB%B3%B4%ED%8A%B8.cpp

GitHub - developeSHG/Algorithm-Baekjoon_Programmers: 백준 and 프로그래머스 소스코드