我一定要认真读题 #2

赛时代码：

#include <iostream>
#include <cstdio>
#include <algorithm>
#define int long long
using namespace std;
int a[105][105];
int n, m, k, s, x, y;
signed main(){
	ios::sync_with_stdio(0);
	cin.tie(0), cout.tie(0);
	cin >> n >> m >> k >> s >> x >> y;
	for(int i = 1; i <= n; i++){
		for(int j = 1; j <= n; j++){
			cin >> a[i][j];
		}
	}
	int val = max({a[x][y], a[x - 1][y], a[x][y - 1], a[x + 1][y], a[x][y + 1]});
	if(m * s <= val * k) cout << "yes";
	else cout << "See you again";

	return 0;
}

AC代码：

#include <iostream>
#include <cstdio>
#include <algorithm>
#define int long long
using namespace std;
int a[105][105];
int n, m, k, s, x, y;
signed main(){
	ios::sync_with_stdio(0);
	cin.tie(0), cout.tie(0);
	cin >> n >> m >> k >> s >> x >> y;
	for(int i = 1; i <= n; i++){
		for(int j = 1; j <= n; j++){
			cin >> a[i][j];
		}
	}
	int val = max({a[x][y], a[x - 1][y], a[x][y - 1], a[x + 1][y], a[x][y + 1]});
	if(m * s <= val * k) cout << "yes";
	else cout << "See you again.";

	return 0;
}