1547.txt

北大ACM题目例程 详细的解答过程 程序实现 算法分析

#include <stdio.h>

struct person
{
	int x, y, z;
	int v;
	char name[20];
}p[10];

int n;

int main()
{
	int i, j, n;

	while( 1 )
	{
		scanf( "%d", &n );
		if( n < 0 ) break;

		for( i=0; i<n; i++ )
		{
			scanf( "%d %d %d %s", &p[i].x,&p[i].y,&p[i].z,&p[i].name );
			p[i].v = p[i].x * p[i].y * p[i].z;
		}

		j = 0;
		for( i=1; i<n; i++ )
			if( p[i].v > p[j].v )
				j = i;
		printf( "%s took clay from ", p[j].name );

		j = 0;
		for( i=1; i<n; i++ )
			if( p[i].v < p[j].v )
				j = i;
		printf( "%s.\n", p[j].name );
	}
	
	return 0;
}