# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
755032 | Unforgettablepl | Quality Of Living (IOI10_quality) | C++17 | 0 ms | 0 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
/*
ID: samikgo1
TASK:
LANG: C++
*/
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll,ll> pll;
#define all(x) x.begin(),x.end()
#define allr(x) x.rbegin(),x.rend()
#define f first
#define s second
//#define x first
//#define y second
const int INF = INT32_MAX;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(nullptr);
// freopen("haybales.in","r",stdin);
// freopen("haybales.out","w",stdout);
ll r,c,h,w;
cin >> r >> c >> h >> w;
vector<vector<ll>> grid(r,vector<ll>(c));
for(auto&i:grid)for(ll&j:i)cin>>j;
ll ans = INFINITY;
for (int i = 0; i < r-h; i++) {
for (int j = 0; j < c-w; j++) {
vector<ll> quality;
for (int k = i; k < i+h; k++) {
for (int l = j; l < j+h; l++) {
quality.emplace_back(grid[k][l]);
}
}
ans = min(ans,quality[quality.size()>>1]);
}
}
cout << ans;
}