Author: | A. Klenin | Time limit: | 2 sec | |
Input file: | input.txt | Memory limit: | 256 Mb | |
Output file: | output.txt | |||
Maximum points: | 82 |
Given the sequence of integers A1, A2, …, AN, find a number As such that there exists exactly one Am > As, and for all k ≠ m Ak ≤ As.
No. | Input file (input.txt ) |
Output file (output.txt ) |
---|---|---|
1 |
|
|
2 |
|
|