简单题
#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
int main()
{
int x,y,t;
while(1)
{
cin >> x >> y;
if(!x && !y) break;
vector<int> people,beds,nobeds;
for(int i = 0;i<y;i++)
{
cin >> t;
people.push_back(t);
}
int times = 0;
for(vector<int>::iterator it = people.begin();it != people.end();it++)
{
if(find(beds.begin(),beds.end(),*it) != beds.end())
{
if(find(nobeds.begin(),nobeds.end(),*it) == nobeds.end())
{
times ++;
nobeds.push_back(*it);
}
}
else
beds.push_back(*it);
}
cout << times << endl;
}
return 0;
}