func_code_string: #include <bits/stdc++.h>   #pragma comment(linker,  /STACK:64000000000 )   using namespace std;   const double EPS = 1e-9;   const int INF = (int)(2e9 + 0.5);   const int MAXN = 201000;   int n, k, a;   vector<int> mass;   set<int> minima;   map<int, int> bad;   int main() {     scanf( %d%d , &n, &k);     for (int i = 0; i < n; ++i) {       scanf( %d , &a);       mass.push_back(-a);     }     for (int i = 0; i < k; ++i) {       bad[mass[i]]++;       if (bad[mass[i]] != 1) {         if (minima.count(mass[i])) minima.erase(mass[i]);       } else         minima.insert(mass[i]);     }     for (int l = 0, r = k - 1; r < n; ++l, ++r) {       if (!minima.size())         printf( Nothing n );       else         printf( %d n , -(*minima.begin()));       bad[mass[l]]--;       if (bad[mass[l]] == 1) minima.insert(mass[l]);       if (bad[mass[l]] != 1)         if (minima.count(mass[l])) minima.erase(mass[l]);       if (r + 1 < n) {         bad[mass[r + 1]]++;         if (bad[mass[r + 1]] != 1) {           if (minima.count(mass[r + 1])) minima.erase(mass[r + 1]);         } else           minima.insert(mass[r + 1]);       }     }     return 0;   }   