Mex value

input/code.cpp: In function 'int main()':
input/code.cpp:17:57: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     int n, k, base = -1, cnt1 = 1; scanf("%d%d", &n, &k);
                                                         ^
input/code.cpp:19:27: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
         scanf("%d", &a[i]);
                           ^

#include <bits/stdc++.h>
#define MAXN 100010
#define INF 1000000007
#define INFPAIR make_pair(INF, INF)
///Naci base
using namespace std;
 
map<int, int> b2h, h2b;
set<int> raz;
int a[MAXN], cnt[MAXN];
pair<int,int> seg[4*MAXN];
void init_stablo(int,int,int);
void update(int,int,int,int,int);
pair<int, int> find_mex(int,int,int,int,int);
 
int main() {
    int n, k, base = -1, cnt1 = 1; scanf("%d%d", &n, &k);
    for(int i = 1; i <= n; i++) {
        scanf("%d", &a[i]);
        raz.insert(a[i]);
    }
    for(set<int>::iterator it = raz.begin(); it != raz.end(); it++) {
        if(base == -1 && *it != cnt1-1) base = cnt1-1;
        if(b2h[*it] == 0) {
            b2h[*it] = cnt1;
            h2b[cnt1++] = *it;
        }
    }
    if(base == -1) base = cnt1-1;
    //printf("%d ", base);
    for(int i = 1; i <= n; i++) a[i] = b2h[a[i]];
    int left = 1, right = 1;
    while(right < k) {
        cnt[a[right]]++;
        right++;
    }
    init_stablo(1,n,1);
    ///Dovde radi 100%
    while(right <= n) {
        update(1, n, 1, a[right], 1);
        pair<int,int> sup_mex = find_mex(1, n, 1, 1, cnt1-1);
        //printf("%d %d\n", sup_mex.first, sup_mex.second);
        int rez, cur = h2b[sup_mex.second];
        //printf("%d %d\n", base, cur);
        if(sup_mex.first != 0) rez = base;
        else rez = min(base, cur);
        printf("%d ", rez);
        update(1, n, 1, a[left], -1);
        left++; right++;
    }
    return 0;
}
 
void init_stablo(int l, int r, int idx) {
    if(l == r) {
        seg[idx] = make_pair(cnt[l], l);
        return;
    }
    int mid = (l+r)/2;
    init_stablo(l, mid, idx*2);
    init_stablo(mid+1, r, idx*2+1);
    seg[idx] = min(seg[idx*2], seg[idx*2+1]);
}
void update(int l, int r, int idx, int gde, int val) {
    if(l == r) {
        cnt[gde] += val;
        seg[idx].first += val;
        return;
    }
    int mid = (l+r)/2;
    if(gde <= mid) update(l, mid, 2*idx, gde, val);
    if(gde > mid) update(mid+1, r, 2*idx+1, gde, val);
    seg[idx] = min(seg[idx*2], seg[idx*2+1]);
}
pair<int, int> find_mex(int l, int r, int idx, int ql, int qr) {
    if(ql <= l && r <= qr) return seg[idx];
    pair<int, int> rez = make_pair(INF, INF);
    int mid = (l+r)/2;
    if(ql <= mid) rez = min(rez, find_mex(l, mid, 2*idx, ql, qr));
    if(qr > mid) rez = min(rez, find_mex(mid+1, r, 2*idx+1, ql, qr));
    return rez;
}

Test 1

Group: 1

Verdict: ACCEPTED

Test 2

Group: 1

Verdict: ACCEPTED

Test 3

Group: 1

Verdict: ACCEPTED

Test 4

Group: 1

Verdict: ACCEPTED

Test 5

Group: 1

Verdict: ACCEPTED

Test 6

Group: 1

Verdict: ACCEPTED

Test 7

Group: 1

Verdict: ACCEPTED

Test 8

Group: 1

Verdict: ACCEPTED

Test 9

Group: 1

Verdict: ACCEPTED

Test 10

Group: 1

Verdict: ACCEPTED

Test 11

Group: 2

Verdict: ACCEPTED

Test 12

Group: 2

Verdict: ACCEPTED

Test 13

Group: 2

Verdict: ACCEPTED

Test 14

Group: 2

Verdict: ACCEPTED

Test 15

Group: 2

Verdict: ACCEPTED

Test 16

Group: 2

Verdict: ACCEPTED

Test 17

Group: 2

Verdict: ACCEPTED

Test 18

Group: 2

Verdict: ACCEPTED

Test 19

Group: 2

Verdict: ACCEPTED

Test 20

Group: 2

Verdict: ACCEPTED