A Discrete Mathematics professor has a class of students. Frustrated with their lack of discipline, the professor decides to cancel class if fewer than some number of students are present when class starts. Arrival times go from on time () to arrived late ().
Given the arrival time of each student and a threshhold number of attendees, determine if the class is cancelled.
The first students arrived on. The last were late. The threshold is students, so class will go on. Return YES.
Note: Non-positive arrival times () indicate the student arrived early or on time; positive arrival times () indicate the student arrived minutes late.
Complete the angryProfessor function in the editor below. It must return YES if class is cancelled, or NO otherwise.
angryProfessor has the following parameter(s):
int k: the threshold number of students
int a[n]: the arrival times of the students
string: either YES or NO
The first line of input contains , the number of test cases.
Each test case consists of two lines.
The first line has two space-separated integers, and , the number of students (size of ) and the cancellation threshold.
The second line contains space-separated integers () that describe the arrival times for each student.
-1 -3 4 2
0 -1 2 1
For the first test case, . The professor wants at least students in attendance, but only have arrived on time ( and ) so the class is cancelled.
For the second test case, . The professor wants at least students in attendance, and there are who arrived on time ( and ). The class is not cancelled.