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

using namespace std;

vector<int> solution(vector<int> arr) {
    vector<int> answer;
    int min = arr[0];
    
    if(arr.size()==1){
        return {-1};
    }
    
    for(int i=1;i<arr.size();i++){ //최솟값 판별
        if(min > arr[i]){
            min = arr[i];
        }
    }
    
    for(int i=0;i<arr.size();i++){
        if(arr[i]!=min){
            answer.push_back(arr[i]);
        } else {
            continue;
        }
    }
    
    return answer;
}