Morning light hits the cinnabar mines of Vermilion as Lothar unrolls the day's manifest of stamps. The tally will decide the next shipment. 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 <= 803; 0 <= a[i] <= 1000; answers fit a signed 64-bit integer.
Example 1:
Example 2:
Example 3:
Constraints:
1 <= n <= 803; 0 <= a[i] <= 1000; answers fit a signed 64-bit integer.
