Count Elements Less Than K

Problem Statement

Count Elements Less Than K Problem Description You are given a list of N integers and one more integer K . Find how many elements of the list are strictly less than K . An element equal to K is not counted. Input Format Read from standard input. N element[1] element[2] ... element[N] K Line 1 contains the integer N , the number of elements in the list. Line 2 contains the N integers of the list, separated by single spaces. Line 3 contains the integer K , the value to compare against. Output Format Print a single integer: the number of elements that are strictly less than K . If no element is smaller than K , print 0 . (inferred -- the source says "a positive integer", but the count can be zero, as in Example 3.) Constraints 1 <= N <= 15000 . (inferred -- the source gives no bound on N; this one keeps the largest input under this judge's 200000-byte input limit.) -10^9 <= element[i] <= 10^9 -10^9 <= K <= 10^9 The answer is between 0 and N , so a 32-bit integer is enoug