Minimal Threshold for Rounds

In this problem, you are given \(T\) test case(s). For each test case, you are given \(N\) rounds with their corresponding difficulty levels. Your task is to determine the minimal threshold \(M\) such that no round's difficulty exceeds \(M\). Formally, the threshold is defined as \(M = \max\{d_1, d_2, \dots, d_N\}\), where \(d_i\) represents the difficulty of the \(i\)-th round.

inputFormat

The input is read from stdin and consists of multiple test cases. The first line contains an integer \(T\), the number of test cases. Each test case consists of two lines:

• The first line contains an integer \(N\), the number of rounds.
• The second line contains \(N\) space-separated integers representing the difficulty levels for each round.

outputFormat

For each test case, output the minimal threshold \(M\) on a separate line to stdout.

1
4
2 5 3 4

5