#include <bits/stdc++.h>
#include "quality.h"
#pragma GCC optimize("Ofast")
#pragma GCC target("avx2")
using namespace std;
void add(int x, multiset<int>& low, multiset<int>& hig){
int m;
if(low.size() == 0) m = 0;
else m = *(--low.end());
if(x >= m){
hig.insert(x);
while(hig.size() > low.size()){
low.insert(*hig.begin());
hig.erase(*hig.begin());
}
}
else {
low.insert(x);
while(low.size() > hig.size() + 1) {
hig.insert(*(--low.end()));
low.erase(--low.end());
}
}
}
void rem(int x, multiset<int>& low, multiset<int>& hig){
if(low.find(x) != low.end()){
low.erase(low.find(x));
while(hig.size() > low.size()){
low.insert(*hig.begin());
hig.erase(*hig.begin());
}
}
else {
hig.erase(hig.find(x));
while(low.size() > hig.size() + 1) {
hig.insert(*(--low.end()));
low.erase(--low.end());
}
}
}
int rectangle(int r, int c, int h, int w, int v[3001][3001]){
multiset<int> low, hig;
int mn = INT_MAX;
for (int i = 0; i <= r - h; i++) {
low.clear();
hig.clear();
for (int j = 0; j < w; j++) {
for (int k = 0; k < h; k++){
add(v[i + k][j], low, hig);
}
}
mn = min(mn, (*--low.end()));
for (int j = w; j < c; j++) {
for (int k = 0; k < h; k++) {
rem(v[i + k][j - w], low, hig);
}
for (int k = 0; k < h; k++) {
add(v[i + k][j], low, hig);
}
mn = min(mn, (*--low.end()));
}
}
return mn;
}
