uri 1553 solution in cpp
by ujjal roy
#include<bits/stdc++.h>
using namespace std;
main()
{
int n,k,i,c=0;
while(cin>>n>>k)
{
c=0;
if(n==0&&k==0) break;
map<int,int> m;
vector<int > v(n);
for(i=0;i<n;i++)
{
cin>>v[i];
m[v[i]]++;
}
sort(v.begin(),v.end());
int u=unique(v.begin(),v.end())-v.begin();
for(i=0;i<u;i++)
{
if(m[v[i]]>=k) c++;
}
cout<<c<<endl;
}
return 0;
}
0 Comments