#include <bits/stdc++.h>
using namespace std;
// Speed
#define fast_io ios::sync_with_stdio(0); cin.tie(0); cout.tie(0)
// Typedefs
#define int long long
#define pb push_back
#define ff first
#define ss second
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define sz(x) ((int)(x).size())
#define endl '\n'
// Loops
#define rep(i,a,b) for(int i=a;i<b;++i)
#define each(x, a) for (auto &x : a)
void solve() {
int n;
cin >> n;
vector<int> a(n);
unordered_map<int,int> freq;
rep(i,0,n) {
cin >> a[i];
freq[a[i]]++;
}
int kept = 0;
for (auto &p : freq) {
int v = p.first;
int f = p.second;
if (f < v) {
}
else {
kept += v;
}
}
cout << (n - kept) << endl;
}
int32_t main() {
fast_io;
int t;
cin >> t;
while (t--) solve();
return 0;
}
I2luY2x1ZGUgPGJpdHMvc3RkYysrLmg+CnVzaW5nIG5hbWVzcGFjZSBzdGQ7CgovLyBTcGVlZAojZGVmaW5lIGZhc3RfaW8gaW9zOjpzeW5jX3dpdGhfc3RkaW8oMCk7IGNpbi50aWUoMCk7IGNvdXQudGllKDApCgovLyBUeXBlZGVmcwojZGVmaW5lIGludCBsb25nIGxvbmcKI2RlZmluZSBwYiBwdXNoX2JhY2sKI2RlZmluZSBmZiBmaXJzdAojZGVmaW5lIHNzIHNlY29uZAojZGVmaW5lIGFsbCh4KSAoeCkuYmVnaW4oKSwgKHgpLmVuZCgpCiNkZWZpbmUgcmFsbCh4KSAoeCkucmJlZ2luKCksICh4KS5yZW5kKCkKI2RlZmluZSBzeih4KSAoKGludCkoeCkuc2l6ZSgpKQojZGVmaW5lIGVuZGwgJ1xuJwoKLy8gTG9vcHMKI2RlZmluZSByZXAoaSxhLGIpIGZvcihpbnQgaT1hO2k8YjsrK2kpCiNkZWZpbmUgZWFjaCh4LCBhKSBmb3IgKGF1dG8gJnggOiBhKQoKdm9pZCBzb2x2ZSgpIHsKICAgIGludCBuOwogICAgY2luID4+IG47CgogICAgdmVjdG9yPGludD4gYShuKTsKICAgIHVub3JkZXJlZF9tYXA8aW50LGludD4gZnJlcTsKCiAgICByZXAoaSwwLG4pIHsKICAgICAgICBjaW4gPj4gYVtpXTsKICAgICAgICBmcmVxW2FbaV1dKys7CiAgICB9CgogICAgaW50IGtlcHQgPSAwOwoKICAgIGZvciAoYXV0byAmcCA6IGZyZXEpIHsKICAgICAgICBpbnQgdiA9IHAuZmlyc3Q7CiAgICAgICAgaW50IGYgPSBwLnNlY29uZDsKCiAgICAgICAgaWYgKGYgPCB2KSB7CiAgICAgICAgfSAKICAgICAgICBlbHNlIHsKICAgICAgICAgICAga2VwdCArPSB2OwogICAgICAgIH0KICAgIH0KCiAgICBjb3V0IDw8IChuIC0ga2VwdCkgPDwgZW5kbDsKfQoKaW50MzJfdCBtYWluKCkgewogICAgZmFzdF9pbzsKICAgIGludCB0OwogICAgY2luID4+IHQ7CiAgICB3aGlsZSAodC0tKSBzb2x2ZSgpOwogICAgcmV0dXJuIDA7Cn0K