hdu 5210 Delete（set）

Delete

Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/65536 K (Java/Others)
Total Submission(s): 209    Accepted Submission(s): 142

Problem Description

WLD likes playing with numbers. One day he is playing with N integers. He wants to delete K 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 100 )

For each case:

The first line contains one integer N(0<N≤100) .

The second line contains N integers a1,a2,...,aN(1≤ai≤N) , denoting the integers WLD plays with.

The third line contains one integer K(0≤K<N) .

 

Output

For each case:

Print one integer. It denotes the maximum of different numbers remain after the deletion.

 

Sample Input

  
  

   
   4
1 3 1 2 
1
  
  

 

Sample Output

  
  

   
   3


   
   

    
    

     
     Hint
    
    
if WLD deletes a 3, the numbers remain is [1,1,2],he'll get 2 different numbers.
if WLD deletes a 2, the numbers remain is [1,1,3],he'll get 2 different numbers.
if WLD deletes a 1, the numbers remain is [1,2,3],he'll get 3 different numbers.
   
   
   
   


   
   
   
   


   
   
   
   

    
    题意：
   
   
   
   

    
    从n个数中删k个数，求剩下的数中最多有多少个不同的数
   
   
   
   

    
    代码：
    
    
#include<cstdio>
#include<set>
using namespace std;

int a[105];

int main()
{
    set<int> st;
    int n;
    while(scanf("%d",&n)==1)
    {
        st.clear();
        for(int i=0;i<n;i++)
        {
            scanf("%d",&a[i]);
            st.insert(a[i]);
        }
        int cnt=n-st.size();
        int k;
        scanf("%d",&k);
        if(k<=cnt)
            printf("%d\n",st.size());
        else
            printf("%d\n",st.size()-k+cnt);
    }
    return 0;
}