https://github.com/letsdeepchat/angry-professor

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 (arrivalTime =<0) to arrived late (arrivalTime>0). Given the arrival time of each student and a threshhold number of attendees, determine if the class is cancelled. Example n=5 k=3 a = [-2,-1,0,1,2] The first 3 students arrived on or before time. The last 2 were late. The threshold is 3 students, so class will go on. Return YES. Note: Non-positive arrival times (arrivalTime=<0) indicate the student arrived early or on time; positive arrival times (arrivalTime>0) indicate the student arrived a[i] minutes late. Return string: either YES or NO 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 and k, the number of students (size of a) and the cancellation threshold. The second line contains n space-separated integers (a[i]) that describe the arrival times for each student. Constraints 1<=t<=10 1<=n<=1000 1<=k<=n -100<=a[i]<=100 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 only 2 have arrived on time ( -3 and -1) so the class is cancelled. For the second test case, k=2. The professor wants at least 2 students in attendance, and there are 2 who arrived on time (0 and 2). The class is not cancelled.
https://github.com/letsdeepchat/angry-professor

Last synced: about 2 months ago
JSON representation

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 (arrivalTime =<0) to arrived late (arrivalTime>0). Given the arrival time of each student and a threshhold number of attendees, determine if the class is cancelled. Example n=5 k=3 a = [-2,-1,0,1,2] The first 3 students arrived on or before time. The last 2 were late. The threshold is 3 students, so class will go on. Return YES. Note: Non-positive arrival times (arrivalTime=<0) indicate the student arrived early or on time; positive arrival times (arrivalTime>0) indicate the student arrived a[i] minutes late. Return string: either YES or NO 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 and k, the number of students (size of a) and the cancellation threshold. The second line contains n space-separated integers (a[i]) that describe the arrival times for each student. Constraints 1<=t<=10 1<=n<=1000 1<=k<=n -100<=a[i]<=100 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 only 2 have arrived on time ( -3 and -1) so the class is cancelled. For the second test case, k=2. The professor wants at least 2 students in attendance, and there are 2 who arrived on time (0 and 2). The class is not cancelled.

• Host: GitHub
• URL: https://github.com/letsdeepchat/angry-professor
• Owner: letsdeepchat
• Created: 2021-11-13T13:52:21.000Z (over 4 years ago)
• Default Branch: main
• Last Pushed: 2021-11-13T13:56:04.000Z (over 4 years ago)
• Last Synced: 2025-02-12T15:41:20.379Z (about 1 year ago)
• Size: 4.88 KB
• Stars: 0
• Watchers: 1
• Forks: 0
• Open Issues: 0
• Metadata Files:
  • Readme: README.md

Awesome Lists containing this project

README

          
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 (arrivalTime =<0) to arrived late (arrivalTime>0).

Given the arrival time of each student and a threshhold number of attendees, determine if the class is cancelled.

Example

n=5

k=3

a = [-2,-1,0,1,2]

The first 3 students arrived on or before time. The last 2 were late. The threshold is 3 students, so class will go on. Return YES.

Note:

Non-positive arrival times (arrivalTime=<0) indicate the student arrived early or on time; positive arrival times (arrivalTime>0) indicate the student arrived a[i] minutes late.

Return string: either YES or NO

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 and k, the number of students (size of a) and the cancellation threshold.

The second line contains n space-separated integers (a[i]) that describe the arrival times for each student.

Constraints

1<=t<=10

1<=n<=1000

1<=k<=n

-100<=a[i]<=100

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 only 2 have arrived on time ( -3 and -1) so the class is cancelled.

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