func_code_string: #include <bits/stdc++.h>   #pragma comment(linker,  /STACK:167772160 )   using namespace std;   int n, i, j, a, b, x[100001], y[100001], v, k, uns[100001], p, q, w[6];   int findd(int l, int r, int xx) {     int t;     t = (l + r) / 2;     if (l == r) {       if (x[l] == xx)         return l;       else         return -1;     } else {       if (x[t] >= xx)         return findd(l, t, xx);       else         return findd(t + 1, r, xx);     }   }   int main() {     cin >> n;     cin >> a >> b;     if (a > b) {       p = 1;       q = 2;     } else {       p = 2;       q = 1;     }     for (i = 0; i < n; i++) {       cin >> x[i];       y[i] = x[i];     }     sort(x, x + n);     if (a == b) {       for (i = 1; i <= a; i++) cout << 1 <<    ;       for (i = 1; i <= b; i++) cout << 2 <<    ;       cout << endl;       return 0;     }     memset(w, 0, sizeof(w));     for (i = 0; i < n; i++) uns[i] = q;     k = 0;     v = max(a, b);     for (i = 0; i < v; i++) w[x[i]]++;     if (p == 1) {       for (i = 0; i < n; i++) {         if (w[y[i]]) {           uns[i] = p;           k++;           w[y[i]]--;         }       }     } else {       for (i = n - 1; i >= 0; i--) {         if (w[y[i]]) {           uns[i] = p;           k++;           w[y[i]]--;         }       }     }     for (i = 0; i < n; i++) cout << uns[i] <<    ;     return 0;   }   