直接上代码：还以为很麻烦呢。。。
[cpp]
#include
#include
#include
#define nMax 110
int hash[nMax];
int N,Q;
int main()
{
int m;
int date;
while (1)
{
scanf("%d %d", &N, &Q);
if (N == 0 && Q == 0)
{
break;
}
memset(hash, 0, sizeof(hash));
for (int i = 0; i < N; ++ i)
{
scanf("%d", &m);
{
scanf("%d", &date);
hash[date] ++;
}
}
int max = -1,k;
for (int i = 0; i < nMax; ++ i)
{
if (max < hash[i])
{
k = i;
max = hash[i];
}
}
if (max < Q)
{
printf("0\n");
}
else
printf("%d\n", k);
}
return 0;
}