Character Selection (APCS 2024-01 Beginner)
Points 100 1.0s 256MThere are \(n\) characters; each has an attack value and a defense value. A character's power is the sum of squares of its attack and defense (i.e. \(a^2 + d^2\)). Output the attack and defense of the character with the second largest power. It is guaranteed that all characters' powers are distinct.
Input
The first line contains an integer \(n\).
The next \(n\) lines each contain two integers \(a_i\) and \(d_i\), the attack and defense of the \(i\)-th character.
Constraints
- \(3 \le n \le 20\)
- \(1 \le a_i, d_i \le 100\)
- All powers (\(a_i^2 + d_i^2\)) are distinct
Output
Output two integers: the attack and defense of the character with the second largest power.
Scoring
The time limit for each test case is \(1\) second; your score is the sum over the test cases you pass. The subtasks are:
- Subtask 1 (\(60\) points): \(n = 3\).
- Subtask 2 (\(40\) points): the general case.
Sample Input 1
3
3 1
5 2
1 4
Sample Output 1
1 4
Sample Input 2
6
6 6
1 3
8 6
5 4
2 8
7 2
Sample Output 2
6 6
Sample Input 3
5
34 35
84 32
39 79
59 89
59 31
Sample Output 3
84 32
Source
APCS programming exam, January 2024, Problem 1.
Log in to write and submit code.
Log in