Count Unique Numbers Above Threshold

Given a list of integers and a threshold (T), your task is to count the number of unique integers in the list that are strictly greater than (T). This problem tests your ability to process input, manipulate arrays, and utilize data structures such as sets to filter out duplicates.

For instance, if the list is [1, 5, 2, 6, 8] and (T = 4), the numbers greater than (T) are 5, 6, and 8, so the correct answer is 3.

inputFormat

The input is read from standard input (stdin) and has the following format:

(n): an integer representing the number of elements in the list.
(a_1, a_2, \ldots, a_n): (n) space-separated integers.
(T): an integer representing the threshold.

outputFormat

Output a single integer on standard output (stdout), which is the count of unique numbers in the list that are strictly greater than the threshold (T).## sample

3
1 2 3
3

0