UVa 11559 - Event Planning * (one linear pass)

Link:https://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&category=27&page=show_problem&problem=2595
Sol:

#include <cstdio>
	#include <algorithm>
	using namespace std;
	int main(){
	int N,B,H,W,p,ans,cap;
	while(scanf("%d %d %d %d",&N,&B,&H,&W) == 4){
	ans = B + 1;
	for(int i = 0;i < H;++i){
	scanf("%d",&p);
	cap = 0;
	for(int j = 0,x;j < W;++j){
	scanf("%d",&x);
	cap = max(cap,x);
	}
	if(cap >= N) ans = min(ans,N * p);
	}
	if(ans == B+1) puts("stay home");
	else printf("%d\n",ans);
	}
	return 0;
	}