# Angry Professor – Python Problem

January 21, 2016 2 Comments

A Discrete Mathematics professor has a class of N students. Frustrated with their lack of discipline, he decides to cancel class if fewer than K students are present when class starts.

Given the arrival time of each student, determine if the class is canceled.

Input Format

The first line of input contains T, the number of test cases.

Each test case consists of two lines. The first line has two space-separated integers, N(students in the class) and K (the cancelation threshold).
The second line contains N space-separated integers (a1,a2,,aN) describing the arrival times for each student.

Note: Non-positive arrival times (ai0) indicate the student arrived early or on time; positive arrival times (ai>0) indicate the student arrived ai minutes late.

Output Format

For each test case, print the word YES if the class is canceled or NO if it is not.

Constraints

• 1T10
• 1N1000
• 1KN
• 100ai100,where i[1,N]

Note
If a student arrives exactly on time (ai=0), the student is considered to have entered before the class started.

Sample Input

2
4 3
-1 -3 4 2
4 2
0 -1 2 1


Sample Output

YES
NO


Explanation

For the first test case, K=3. The professor wants at least 3 students in attendance, but only2 have arrived on time (3 and 1). Thus, the class is canceled.

For the second test case, K=2. The professor wants at least 2 students in attendance, and there are 2 who have arrived on time (0 and 1). Thus, the class is not canceled.

My Solution:

### Author Naveen

A Computer Science graduate student, a programmer, photographer, reader and blogger

### Join the discussion 2 Comments

• shap says:

There is no need to sort, the complexity becomes O(nlgn) that way. You could simply loop (L10-L18) in O(N).

• Naveen says:

Yes, I do agree with you Shap… I made the change accordingly.. thank you for that… 🙂