CT23542

The Obsidian barrels of Admiral

EasyL3 · Syntax SurferAcceptance: 0.0%XP: 20

It is audit day at the fjord village of Deepwater. Admiral spreads the barrels records across the table and picks up a sharp pencil. Task: Read n integers and a threshold t; print how many exceed t. Input format: First line: n and t. Second line: n space-separated integers. Output format: Print the count of values strictly greater than t. Constraints: 1 <= n <= 842; 0 <= a[i],t <= 10.

Example 1:

Input: 91 4 5 0 10 5 6 10 2 0 8 4 3 6 0 0 0 3 3 4 8 3 6 8 1 1 8 9 2 0 10 1 7 6 7 5 7 7 5 4 3 3 8 10 4 2 5 1 10 4 1 0 8 0 8 8 3 5 10 10 4 9 1 10 3 2 10 9 5 1 10 7 0 0 8 2 5 7 8 9 4 8 10 4 3 0 8 10 0 1 9 6 0
Output: 48

Example 2:

Input: 598 5 7 9 3 4 8 1 6 7 1 3 5 10 8 6 0 3 8 9 10 7 3 3 7 4 9 10 6 9 2 0 8 9 6 6 2 0 9 9 7 0 1 9 4 0 6 6 7 6 10 5 3 4 2 7 9 9 3 7 4 1 6 8 9 1 0 8 9 0 0 6 2 6 0 6 5 2 3 4 10 7 0 6 10 1 3 2 1 0 4 7 2 8 2 10 6 0 10 7 6 9 5 8 6 10 6 8 6 9 4 8 0 3 9 2 9 2 7 8 4 2 0 5 4 9 5 7 1 5 6 3 1 10 10 4 0 5 9 2 1 6 6 1 4 4 1 4 10 4 5 0 7 9 8 6 8 0 2 6 5 3 5 1 7 7 7 10 3 9 7 10 6 5 10 7 10 10 4 0 0 3 1 0 7 2 3 10 7 4 8 8 6 3 7 4 4 6 8 4 8 7 9 5 5 7 1 6 4 2 7 1 0 5 10 6 6 3 0 7 10 3 4 3 10 1 3 0 3 2 8 10 8 10 2 10 4 10 3 7 7 7 8 7 6 4 0 1 1 10 7 1 1 6 10 4 3 10 10 10 3 5 3 10 5 3 6 8 2 2 1 2 10 1 7 5 9 8 4 7 7 4 4 5 2 10 10 6 3 9 0 0 7 0 8 6 3 7 5 2 0 10 6 7 1 1 2 3 10 7 5 1 1 0 1 0 8 2 1 4 7 2 7 8 10 1 2 4 7 3 1 0 10 9 3 6 6 3 5 1 7 9 8 6 4 7 9 10 2 4 7 10 5 10 10 10 0 8 10 1 1 3 6 7 9 1 2 4 3 9 0 2 9 7 0 9 8 4 2 8 2 9 10 0 2 5 10 10 1 8 7 0 3 9 7 8 5 2 9 10 10 8 8 1 0 7 10 10 1 9 6 1 8 6 7 4 4 3 7 4 8 4 8 2 6 2 10 3 8 10 8 2 8 6 6 9 0 9 0 0 10 8 6 8 0 5 4 6 3 10 2 7 5 10 4 5 3 5 2 1 2 9 2 8 1 0 4 2 0 0 4 7 7 7 9 5 2 5 6 10 7 7 5 8 5 1 8 8 1 4 10 5 3 5 6 10 10 4 5 6 9 10 1 5 2 4 1 2 3 2 10 2 10 1 10 6 0 1 10 8 2 6 10 7 6 9 4 8 9 5 4 0 0 10 8 8 2 5 8 2 7 3 2 9 9 6 0 1 3 1 7 9 6 0 9 9 8 6 9 9 0 6 9 3 2 5 7 1 2 2 2 9 1 5 2 5 4 4 3 0 8 6 10 8 9 9 2 9 10 9 1 8 8 3 9 1 10 7 10 7
Output: 301

Example 3:

Input: 220 4 6 2 4 7 6 5 9 0 9 8 6 6 4 10 2 2 2 2 9 3 5 6 10 6 10 0 10 1 5 10 7 10 6 5 4 8 5 4 0 3 5 1 6 3 7 2 9 7 7 5 7 2 6 7 6 10 3 9 2 6 6 6 10 6 10 3 2 2 8 5 5 6 8 4 7 4 7 9 7 9 10 10 9 3 6 5 3 3 6 3 9 5 4 1 1 0 1 5 8 9 8 0 7 5 4 8 3 5 3 8 1 6 7 9 9 4 4 1 3 9 0 2 10 4 4 6 5 8 6 10 6 0 10 4 2 7 2 1 2 4 8 2 4 7 1 6 9 8 1 6 5 0 8 7 9 1 5 4 8 3 0 2 1 8 9 4 10 7 8 1 2 6 7 10 8 10 0 1 1 9 9 0 6 1 7 3 3 3 6 1 5 1 9 4 10 3 1 9 1 4 4 8 2 9 6 0 5 9 5 0 0 10 2 5 7 5 5 8 0 4
Output: 128

Constraints:

1 <= n <= 842; 0 <= a[i],t <= 10.

Loading...
Test Cases:No test cases
No test cases available.