class Solution {
public:
int distributeCandies(vector<int>& candies) {
set<int> cl;
int count = 0;
for(int i=0;i<candies.size();i++)
{
if(cl.find(candies[i])==cl.end())
{
cl.insert(candies[i]);
count ++;
}
}
if(count>=candies.size()/2)return candies.size()/2;
else return count;
}
};