프로그래밍_일반/백준
boj 5176
Spadework
2020. 3. 6. 08:53
* Solved 기준 브론즈2 단순 풀이
for _ in range(int(input())):
p,m = map(int, input().split())
l,s = [0]*(m+1),0
for _ in range(p):
a = int(input())
if not(l[a]): l[a]=1
else: s += 1
print(s)