UVa 11559 - Event Planning

题目：寻找满足条件的最小值。

分析：简单题。

#include <stdio.h>
#include <stdlib.h>

int p[ 20 ];
int a[ 20 ][ 15 ];

int main()
{
	int N,B,H,W; 
	while ( scanf("%d%d%d%d",&N,&B,&H,&W) != EOF ) {
		for ( int h = 1 ; h <= H ; ++ h ) {
			scanf("%d",&p[ h ]);
			for ( int w = 1 ; w <= W ; ++ w )
				scanf("%d",&a[ h ][ w ]);
		}
		
		int Min = 2000005;
		for ( int w = 1 ; w <= W ; ++ w )
			for ( int h = 1 ; h <= H ; ++ h )
				if ( a[ h ][ w ] >= N && Min > p[ h ]*N )
					Min = p[ h ]*N;
		
		if ( Min == 2000005 || Min > B )
			printf("stay home\n");
		else printf("%d\n",Min);
	}
	return 0;
}