[프로그래머스/C++] 최댓값 만들기 (2)

문제

정수 배열 numbers가 매개변수로 주어집니다. numbers의 원소 중 두 개를 곱해 만들 수 있는 최댓값을 return하도록 solution 함수를 완성해주세요.

 

솔루션

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

using namespace std;

int solution(vector<int> numbers) {
    int answer = 0;
    sort(numbers.begin(), numbers.end());
    if(numbers[0]*numbers[1] > numbers[numbers.size()-1]*numbers[numbers.size()-2]){
        return numbers[0]*numbers[1];
    }
    else{
        return numbers[numbers.size()-1]*numbers[numbers.size()-2];
    }
}

 

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