2437430_ac_0ms_44k.cpp

北大大牛代码 1240道题的原代码 超级权威

#include <algorithm>
using namespace std;

int a[1001];
bool cmp(int a,int b)
{
	return a>b;
}

int main()
{
	int n, k, i, ans, cas = 1;
	int min, j, tmp;
	char name[81];

	while(scanf("%d%d",&n,&k)==2)
	{
		if(n==0&&k==0)
			break;
		printf("Case %d: ",cas++);
		for(i = 0; i < n; i++)
		{
			scanf("%s",name);
			a[i] = strlen(name);
		}
		sort(a,a+n,cmp);
		ans = 0;
		for(i = 0; i < n; i+=k)
		{
			tmp = 0;
			min = (a[i]-2)*k;
			for(j = i; j < i+k; j++)
				tmp += a[j];
			if(tmp<min)
			{
				printf("no\n\n");
				goto con;
			}
		}
		printf("yes\n\n");
con:
		;
	}
	return 1;
}