프로그래머스 폰켓몬

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

using namespace std;

int index[200002];
vector <int> temp;
int solution(vector<int> nums)
{
    int answer = 0;
    int n = nums.size()/2;
    for(int i = 0; i< nums.size(); i++)
    {
        if (index[nums[i]] != 1)
        {    
            index[nums[i]] = 1;
            temp.push_back(nums[i]);
        }
    }
    if (n > temp.size())
        return temp.size();
    else
        return n;
}