Count Elements Less Than K

Problem Statement

Count Elements Less Than K Problem Description You are given a list of integers and an integer K. Write an algorithm to find the number of elements in the list that are strictly less than K. Input The first line of the input consists of an integer - element_size , representing the number of elements in the list (N). The second line consists of N space-separated integers - element[1], element[2], ......., element[N] , representing the list of integers. The last line consists of an integer K , representing the integer to be compared. Output Print a positive integer representing the number of elements in the list that are strictly less than K. Examples Example 1: Input: 7 1 7 4 5 6 3 2 5 Output: 4 Explanation: The numbers in the list [1, 7, 4, 5, 6, 3, 2] that are strictly less than 5 are 1, 4, 3, 2 . There are 4 such numbers. Constraints -10^9 -10^9 for each element i in the list. #include <iostream> using namespace std; int main() { // Write your code here return 0; }