func_code_string: #include <bits/stdc++.h>   using namespace std;   map<long long, int> m;   map<long long, int>::iterator it;   int main() {     int n, k, q, a[150001];     cin >> n >> k >> q;     for (int i = 1; i <= n; i++) cin >> a[i];     while (q--) {       int x, y;       cin >> x >> y;       if (x == 1)         m.insert(make_pair(-a[y], y));       else {         int count = 0, p = 1;         if (m.find(-a[y]) == m.end())           p = 0;         else {           for (it = m.begin(); it != m.end(); it++) {             if (it->first == -a[y])               break;             else               count++;             if (count == k) {               p = 0;               break;             }           }         }         if (p)           cout <<  YES n ;         else           cout <<  NO n ;       }     }     return 0;   }   