제일 작은 수 제거하기 - 1단계 (C++)

#include <string>
#include <vector>

using namespace std;

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