UOJ#52. 【UR #4】元旦激光炮(交互)

#include "kth.h"
#include <stdio.h>
#include <assert.h>
#include<algorithm>
using namespace std;
int query_kth(int n_a, int n_b, int n_c, int k) {
    int nowa = 0, nowb = 0, nowc = 0, mi;
    while(k) {
        int cur = (k - 2) / 3;
        int vala = get_a(nowa + cur),
            valb = get_b(nowb + cur), 
            valc = get_c(nowc + cur);
        mi = min(vala, min(valb, valc));
        cur++;
        if(mi == vala) nowa += cur;
        else if(mi == valb) nowb += cur;
        else nowc += cur;
        k -= cur;
    }
    return mi;
}