Angry Professor


Problem Statement :


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. The last 2 were late. The threshold is 3 students, so class will go on. Return YES.

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


Function Description

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 n students

Returns
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[1], a[2],......., a[n]) that describe the arrival times for each student.

Constraints
1 <= t <= 10
1 <= n <= 1000
1 <= k <= n
-100 <= a[i] <= 100 where i belongs to [1, ....., n]


Solution :



title-img


                            Solution in C :

python 3  :

t = int(input())

for _ in range(t):
	n, k = map(int, input().split())
	arr = list(map(int, input().split()))

	cnt = 0
	for x in arr:
		if x <= 0:
			cnt += 1
	if cnt >= k:
		print("NO")
	else:
		print("YES")










Java  :


import java.util.Scanner;

public class AngryProfessor {
    public static void main(String[] args) {
    	int numberOfTests = 0;
    	Scanner sc =  new Scanner(System.in);
    	numberOfTests = sc.nextInt();
    	
    	for (int i = 0;i < numberOfTests;i++) {
    		int N = sc.nextInt();
    		int K = sc.nextInt();
    		int arrived = 0;
    		for (int j = 0;j < N;j++) {
    			int currentStudent = sc.nextInt();
    			if (currentStudent <= 0) {
    				arrived++;
    			}
    		}
    		if (arrived>=K) {
    			System.out.println("NO");
    		} else {
    			System.out.println("YES");
    		}
    	}
    	
    	sc.close();
    }
}










C ++  :

#include <bits/stdc++.h>
using namespace std;
int main()
{
	int a; cin >> a;
	for (int g=0; g<a; g++)
	{
		int b,c; cin >> b >> c;
		int num=0; 
		for (int g=0; g<b; g++)
		{
			int d; cin >> d;
			if (d<=0) num++; 
		}
		if (num>=c)
		{
			cout << "NO" << '\n'; 
		}
		else cout << "YES" << '\n';
	}
	return 0; 
}










C  :

/*Angry Professor*/

#include<stdio.h>

int main()
{
	int count, i, K, N, T, time;
	scanf("%d", &T);
	while (T--)
	{
		scanf("%d %d", &N, &K);
		count = 0;
		for (i = 0; i < N; i++)
		{
			scanf("%d", &time);
			if (time <= 0)
				count++;
		}
		puts((count < K) ? "YES" : "NO");
	}
	return 0;
}
                        




View More Similar Problems

Maximum Element

You have an empty sequence, and you will be given N queries. Each query is one of these three types: 1 x -Push the element x into the stack. 2 -Delete the element present at the top of the stack. 3 -Print the maximum element in the stack. Input Format The first line of input contains an integer, N . The next N lines each contain an above mentioned query. (It is guaranteed that each

View Solution →

Balanced Brackets

A bracket is considered to be any one of the following characters: (, ), {, }, [, or ]. Two brackets are considered to be a matched pair if the an opening bracket (i.e., (, [, or {) occurs to the left of a closing bracket (i.e., ), ], or }) of the exact same type. There are three types of matched pairs of brackets: [], {}, and (). A matching pair of brackets is not balanced if the set of bra

View Solution →

Equal Stacks

ou have three stacks of cylinders where each cylinder has the same diameter, but they may vary in height. You can change the height of a stack by removing and discarding its topmost cylinder any number of times. Find the maximum possible height of the stacks such that all of the stacks are exactly the same height. This means you must remove zero or more cylinders from the top of zero or more of

View Solution →

Game of Two Stacks

Alexa has two stacks of non-negative integers, stack A = [a0, a1, . . . , an-1 ] and stack B = [b0, b1, . . . , b m-1] where index 0 denotes the top of the stack. Alexa challenges Nick to play the following game: In each move, Nick can remove one integer from the top of either stack A or stack B. Nick keeps a running sum of the integers he removes from the two stacks. Nick is disqualified f

View Solution →

Largest Rectangle

Skyline Real Estate Developers is planning to demolish a number of old, unoccupied buildings and construct a shopping mall in their place. Your task is to find the largest solid area in which the mall can be constructed. There are a number of buildings in a certain two-dimensional landscape. Each building has a height, given by . If you join adjacent buildings, they will form a solid rectangle

View Solution →

Simple Text Editor

In this challenge, you must implement a simple text editor. Initially, your editor contains an empty string, S. You must perform Q operations of the following 4 types: 1. append(W) - Append W string to the end of S. 2 . delete( k ) - Delete the last k characters of S. 3 .print( k ) - Print the kth character of S. 4 . undo( ) - Undo the last (not previously undone) operation of type 1 or 2,

View Solution →