#include <bits/stdc++.h>
#include "quality.h"
//#pragma GCC optimize("Ofast")
//#pragma GCC target("avx2")
using namespace std;
typedef long long ll;
typedef long double ld;
#define all(v) v.begin(), v.end()
#define ckmin(a, b) a = min(a, b)
void add(int x, set<int>& low, set<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 remove(int x, set<int>& low, set<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());
}
}
}
void rectangle(int r, int c, int h, int w, vector<vector<int>> v)
multiset<int> low, hig;
int mn = INT_MAX;
for (int i = 0; i < r - h; i++) {
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++) {
remove(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()));
}
}
cout << mn << endl;
}
Compilation message
quality.cpp:52:5: error: expected initializer before 'multiset'
52 | multiset<int> low, hig;
| ^~~~~~~~
quality.cpp:54:5: error: expected unqualified-id before 'for'
54 | for (int i = 0; i < r - h; i++) {
| ^~~
quality.cpp:54:21: error: 'i' does not name a type
54 | for (int i = 0; i < r - h; i++) {
| ^
quality.cpp:54:32: error: 'i' does not name a type
54 | for (int i = 0; i < r - h; i++) {
| ^
quality.cpp:74:5: error: 'cout' does not name a type
74 | cout << mn << endl;
| ^~~~
quality.cpp:75:1: error: expected declaration before '}' token
75 | }
| ^
