for _ in range(int(input())):
n,k=map(int,input().split())
a=list(map(int,input().split()))
c=0
for i in range(k):
if(a[i]>k):c+=1
print(c)#include <iostream>
using namespace std;
int main()
{
int t, n, k, temp, count;
cin >> t;
while (t--)
{
cin >> n >> k;
count = 0;
for (int j = 0; j < k; j++)
{
cin >> temp;
if (temp > k)
count++;
}
for (int j = 0; k + j < n; j++)
{
cin >> temp;
}
cout << count << endl;
}
return 0;
}938. Range Sum of BST | 147. Insertion Sort List |
310. Minimum Height Trees | 2110. Number of Smooth Descent Periods of a Stock |
2109. Adding Spaces to a String | 2108. Find First Palindromic String in the Array |
394. Decode String | 902. Numbers At Most N Given Digit Set |
221. Maximal Square | 1200. Minimum Absolute Difference |
1619B - Squares and Cubes | 1619A - Square String |
1629B - GCD Arrays | 1629A - Download More RAM |
1629C - Meximum Array | 1629D - Peculiar Movie Preferences |
1629E - Grid Xor | 1629F1 - Game on Sum (Easy Version) |
2148. Count Elements With Strictly Smaller and Greater Elements | 2149. Rearrange Array Elements by Sign |
2150. Find All Lonely Numbers in the Array | 2151. Maximum Good People Based on Statements |
2144. Minimum Cost of Buying Candies With Discount | Non empty subsets |
1630A - And Matching | 1630B - Range and Partition |
1630C - Paint the Middle | 1630D - Flipping Range |
1328A - Divisibility Problem | 339A - Helpful Maths |