Farmer the assayer watches over the thorn maze of Bramblecourt's stores of crates. A careful computation stands between order and chaos. Task: Read n integers and print how many of the elements after the first are strictly greater than the first element. Input format: First line: n. Second line: n space-separated integers. Output format: Print the count of elements a[2..n] greater than a[1]. Constraints: 1 <= n <= 911; 0 <= a[i] <= 1000; answers fit a signed 64-bit integer.
Example 1:
Example 2:
Example 3:
Constraints:
1 <= n <= 911; 0 <= a[i] <= 1000; answers fit a signed 64-bit integer.
