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

Minimum Average Waiting Time

Tieu owns a pizza restaurant and he manages it in his own way. While in a normal restaurant, a customer is served by following the first-come, first-served rule, Tieu simply minimizes the average waiting time of his customers. So he gets to decide who is served first, regardless of how sooner or later a person comes. Different kinds of pizzas take different amounts of time to cook. Also, once h

View Solution →

Merging Communities

People connect with each other in a social network. A connection between Person I and Person J is represented as . When two persons belonging to different communities connect, the net effect is the merger of both communities which I and J belongs to. At the beginning, there are N people representing N communities. Suppose person 1 and 2 connected and later 2 and 3 connected, then ,1 , 2 and 3 w

View Solution →

Components in a graph

There are 2 * N nodes in an undirected graph, and a number of edges connecting some nodes. In each edge, the first value will be between 1 and N, inclusive. The second node will be between N + 1 and , 2 * N inclusive. Given a list of edges, determine the size of the smallest and largest connected components that have or more nodes. A node can have any number of connections. The highest node valu

View Solution →

Kundu and Tree

Kundu is true tree lover. Tree is a connected graph having N vertices and N-1 edges. Today when he got a tree, he colored each edge with one of either red(r) or black(b) color. He is interested in knowing how many triplets(a,b,c) of vertices are there , such that, there is atleast one edge having red color on all the three paths i.e. from vertex a to b, vertex b to c and vertex c to a . Note that

View Solution →

Super Maximum Cost Queries

Victoria has a tree, T , consisting of N nodes numbered from 1 to N. Each edge from node Ui to Vi in tree T has an integer weight, Wi. Let's define the cost, C, of a path from some node X to some other node Y as the maximum weight ( W ) for any edge in the unique path from node X to Y node . Victoria wants your help processing Q queries on tree T, where each query contains 2 integers, L and

View Solution →

Contacts

We're going to make our own Contacts application! The application must perform two types of operations: 1 . add name, where name is a string denoting a contact name. This must store name as a new contact in the application. find partial, where partial is a string denoting a partial name to search the application for. It must count the number of contacts starting partial with and print the co

View Solution →