思路:
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define pb push_back
#define fi first
#define se second
#define lson p << 1
#define rson p << 1 | 1
const int maxn = 1e6 + 5, inf = 1e18, maxm = 4e4 + 5, N = 1e6, base = 397;
// const int mod = 1e9 + 7;
const __int128 mod = 212370440130137957ll;
int a[maxn], b[maxn];
bool vis[maxn];
int n, m;
string s;
struct Node{
int l, r;
};
void solve(){
int res = 0;
int q, k;
cin >> n >> k;
for(int i = 1; i <= n; i++){
cin >> a[i];
a[i] = a[i] + 1 - i;
}
int cur = 1;//cur为第一小的(下标为1)元素的值,也可以看成位置
while(k--){
int pos = upper_bound(a + 1, a + n + 1, cur) - a - 1;
cur += pos;//把删除元素造成的值的左移转化为下标右移,有pos个0查到当前位置cur之前,cur就要加上pos
}
/*
设n = 2,k = 2,
a: 1 4
pos:1 2 3 4 5 6 7 8
val:1 2 3 4 5 6 7 8
第一次操作后:
pos:0 1 2 0 3 4 5 6
val:1 2 3 4 5 6 7 8
第二次操作后:
pos:0 0 1 0 2 0 3 4
val:1 2 3 4 5 6 7 8
*/
cout << cur << '\n';
}
signed main(){
ios::sync_with_stdio(0);
cin.tie(0);
int T = 1;
cin >> T;
while (T--)
{
solve();
}
return 0;
}