poj2028-水的一塌糊涂
直接上代码：还以为很麻烦呢。。。
#include <stdio.h>#include <stdlib.h>#include <string.h>#define nMax 110int 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);for (int j = 0; j < m; ++ j){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");}elseprintf("%d\n", k);}return 0;}