폰켓몬

#include <vector>
#include <algorithm>

using namespace std;

int solution(vector<int> nums)
{
    int answer = 0;
    int size = nums.size();
    int i;
    
    sort(nums.begin(), nums.end());
    auto it = unique(nums.begin(), nums.end());
    nums.erase(it, nums.end());
    
    if(size/2 < nums.size())
    {
        answer = size/2;
    }
    else
    {
        answer = nums.size();
    }
    
    return answer;
}