[Programmers/C++] 구명보트

출처

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

소스

#include <vector>
#include <algorithm>
 
using namespace std;
 
int solution(vector<int> p, int limit) {
    int answer = 0;
    int boat = 0;
    int i = 0;
    int j = p.size()-1;
    
    sort(p.begin(), p.end());
    reverse(p.begin(), p.end());
    
    while(1){
        if(i > j){
            break;
        }
        else if(i == j){
            boat++;
            break;
        }
        if(p[i] + p[j] > limit){
            i++;
            boat++;
        }
        else{
            i++;
            j--;
            boat++;
        }
    }
    answer = boat;
    return answer;
}