fn run(sc: &mut scanner::Scanner, out: &mut std::io::BufWriter) { let t: u32 = sc.next(); for _ in 0..t { let n: usize = sc.next(); let a = sc.next_vec::(n); writeln!(out, "{}", solve(a)).ok(); } } fn solve(a: Vec) -> usize { let n = a.len(); if n == 1 { return a[0].max(1); } let mut cnt = vec![0usize; n + 2]; for a in a { cnt[a.min(n + 1)] += 1; } let can = |m: usize| -> bool { let mut need = vec![0usize; n + 1]; let mut free = cnt[m..].iter().sum::(); need[m] = 1; let mut add = 0; for i in (0..m).rev() { add += need[i + 1]; add = add.min(n + 1); need[i] += add; let v = need[i].min(cnt[i]); need[i] -= v; free += cnt[i] - v; } need[0] <= free }; let mut ok = 1; let mut ng = n + 1; while ng - ok > 1 { let m = (ok + ng) / 2; if can(m) { ok = m; } else { ng = m; } } ok } // ---------- begin scannner ---------- #[allow(dead_code)] mod scanner { use std::str::FromStr; pub struct Scanner<'a> { it: std::str::SplitWhitespace<'a>, } impl<'a> Scanner<'a> { pub fn new(s: &'a String) -> Scanner<'a> { Scanner { it: s.split_whitespace(), } } pub fn next(&mut self) -> T { self.it.next().unwrap().parse::().ok().unwrap() } pub fn next_bytes(&mut self) -> Vec { self.it.next().unwrap().bytes().collect() } pub fn next_chars(&mut self) -> Vec { self.it.next().unwrap().chars().collect() } pub fn next_vec(&mut self, len: usize) -> Vec { (0..len).map(|_| self.next()).collect() } } } // ---------- end scannner ---------- use std::io::Write; use std::collections::*; type Map = BTreeMap; type Set = BTreeSet; type Deque = VecDeque; fn main() { use std::io::Read; let mut s = String::new(); std::io::stdin().read_to_string(&mut s).unwrap(); let mut sc = scanner::Scanner::new(&s); let out = std::io::stdout(); let mut out = std::io::BufWriter::new(out.lock()); run(&mut sc, &mut out); }