1749C.cpp

#include <bits/stdc++.h>
using namespace std;

#define pii pair<int, int>
#define vt vector
#define ll long long
#define pb push_back
#define ioa insert_or_assign
#define umap unordered_map
#define prq priority_queue
#define F first
#define S second
#define all(c) (c).begin(), (c).end()
#define rev(c) (c).rbegin(), (c).rend()
#define sz(x) (int)(x).size()
#define mset(ar, val) memset(ar, val, sizeof(ar))
#define en '\n'

const int d4r[4] = {-1,0,1,0}; const int d4c[4] = {0,1,0,-1};
const int d8r[8] = {-1,-1,0,1,1,1,0,-1}; const int d8c[8] = {0,1,1,1,0,-1,-1,-1};
const int INF = 0x3f3f3f3f; const int mINF = 0xc0c0c0c0;
const ll LINF = 0x3f3f3f3f3f3f3f3f; const ll mLINF = 0xc0c0c0c0c0c0c0c0;
int T = 1;

void sol() {
	int n;
	cin >> n;

	vt<int> a(n);
	for(int &x : a) cin >> x;

	int ans = 0;
	for(int k=1; k<=n; ++k) {
		multiset<int> s(all(a));
		for(int i=0; i<k; ++i) {
			auto it = s.upper_bound(k-i); // the iterator pointing at the 1st number greater(>) than k-i
			if(it == s.begin()) break;  // no items found

			s.erase(--it);
			if(!s.empty()) {
				int x = *s.begin();
				s.erase(s.begin());
				s.insert(x + k - i);
			}
		}
		if(sz(s) + k == n) ans = k;
	}
	cout << ans << en;
	
	return;
}

int main() {
	ios_base::sync_with_stdio(0); cin.tie(0);
	cin >> T;
	while(T--) {
		sol();
	}

	return 0;
}