zoj 1751 When Can We Meet?

最新推荐文章于 2020-06-20 20:58:39 发布

yzl_rex

最新推荐文章于 2020-06-20 20:58:39 发布

阅读量475

点赞数

分类专栏： ZOJ 文章标签： include

本文链接：https://blog.csdn.net/yzl_rex/article/details/7390961

版权

ZOJ 专栏收录该内容

137 篇文章 0 订阅

订阅专栏

#include "iostream"
#include "memory.h"
#include "algorithm"
using namespace std;

int num[100];
int ans[100];

int main()
{
	int committe, quorum, M, i, j, temp1, temp2;
	bool tag;
	while (cin >> committe >> quorum && committe && quorum)
	{
		memset(num, 0, sizeof(num));
		memset(ans, 0, sizeof(ans));
		tag = false;
		for (i = 0; i < committe; i++)
		{
			cin >> M;
			for (j = 0; j < M; j++)
			{
					cin >> num[j];
					ans[num[j]]++;
			}
		}
		temp1 = temp2 = 0;
		for (i = 0; i < 100; i++)
		{
			if (ans[i] >= quorum)
			{
				if (ans[i] > temp1)
				{
					temp1 = ans[i];
					temp2 = i;
				}
				tag = true;
			}
		}
		if (tag)
			cout << temp2 << endl;
		else
			cout << "0" << endl;
	}
}