#include <vector>
#include <algorithm>
using namespace std;
bool Cmp (int a, int b)
{
return a>b;
}
vector<int> solution(vector<int> arr) {
vector<int> answer;
int Min=arr[0];
int Size=arr.size();
if(Size==1)
{
answer.push_back(-1);
return answer;
}
else
{
for(int i=0; i<Size; i++)
{
if(Min>arr[i])
{
Min=arr[i];
}
}
for(int i=0; i<Size; i++)
{
if(Min==arr[i])
{
arr.erase(arr.begin()+i);
}
}
for(int i=0; i<Size-1; i++)
{
answer.push_back(arr[i]);
}
}
return answer;
}
https://hydroponicglass.tistory.com/170 : min_element / max_element
arr.erase(min_element(arr.begin(), arr.end()));
std에 min_element / max_element 가 있음. 이렇게 활용할수도 있음