hdu 5210 Delete

WLD likes playing with numbers. One day he is playing with NN integers. He wants to delete KK integers from them. He likes diversity, so he wants to keep the kinds of different integers as many as possible after the deletion. But he is busy pushing, can you help him?
Input
There are Multiple Cases. (At MOST 100100)

For each case:

The first line contains one integer N(0

#include<stdio.h>#include<algorithm>using namespace std;int main(){    int n;    while(~scanf("%d",&n))    {        int a[10003];        for(int i=0;i<n;i++)scanf("%d",&a[i]);        sort(a,a+n);        int ans=0;        for(int i=0;i<n-1;i++)            if(a[i]==a[i+1])ans++;        int k=0;        scanf("%d",&k);        int sum=n-ans;        k-=ans;        if(k>0)            sum-=k;        else sum=sum;        printf("%d\n",sum);    }}