[레벨1] 제일 작은 수 제거하기

 

 

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

using namespace std;

vector<int> solution(vector<int> arr) {
    vector<int> answer;
    if(arr.size() <= 1)
    {
        answer.push_back(-1);
        return answer;
    }
    int min = *min_element(arr.begin(),arr.end()),i;
    for(i = 0; i < arr.size(); ++i)
    {
        if(arr[i] == min)
            continue;
        answer.push_back(arr[i]);
    }
    return answer;
}