UVA 501 - Black Box (이분 + 트 리 배열 + 이산 화)

#include <cstdio>
#include <cstring>
#include <algorithm>
#include <iostream>
#include <string>
#include <vector>
#include <stack>
#include <bitset>
#include <cstdlib>
#include <cmath>
#include <set>
#include <list>
#include <deque>
#include <map>
#include <queue>
#define Max(a,b) ((a)>(b)?(a):(b))
#define Min(a,b) ((a)<(b)?(a):(b))
using namespace std;
typedef long long ll;
typedef long double ld;
const ld eps = 1e-9, PI = 3.1415926535897932384626433832795;
const int mod = 1000000000 + 7;
const int INF = 0x3f3f3f3f;
// & 0x7FFFFFFF
const int seed = 131;
const ll INF64 = ll(1e18);
const int maxn = 30000 + 10;
int T,n,m,bit[maxn],id[maxn],a[maxn],b[maxn];
int sum(int x) {
    int ans = 0;
    while(x > 0) {
        ans += bit[x];
        x -= x & -x;
    }
    return ans;
}
void add(int x, int d) {
    while(x <= n) {
        bit[x] += d;
        x += x & -x;
    }
}
int main() {
    scanf("%d",&T);
    while(T--) {
        int cnt = 0;
        scanf("%d%d",&n,&m);
        for(int i = 1; i <= n; i++) {
            scanf("%d",&a[i]);
            id[cnt++] = a[i];
        }
        //     
        sort(id, id+cnt);
        cnt = unique(id, id+cnt) - id;
        for(int j = 1; j <= m; j++) scanf("%d",&b[j]);
        //    
        memset(bit, 0, sizeof(bit));
        int cur = 0;
        for(int i = 1; i <= m; i++) {
            //      id
            if(b[i] > cur) {
                for(int j = cur+1; j <= b[i]; j++) {
                    int v = lower_bound(id, id+cnt, a[j]) - id + 1;
                    add(v, 1);
                }
                cur = b[i];
            }
            int l = 1, r = cnt;
            while(r > l) {
                int mid = (l + r) >> 1;
                int cur = sum(mid);
                if(cur >= i) r = mid;
                else l = mid + 1;
            }
            printf("%d
",id[l-1]);
        }
        if(T) printf("
");
    }
    return 0;
}