# Hackerrank Angry Professor Solution

Problem Statement
The professor is conducting a course on Discrete Mathematics to a class of N students. He is angry at the lack of their discipline, and he decides to cancel the class if there are less than Kstudents present after the class starts.
Given the arrival time of each student, your task is to find out if the class gets cancelled or not.
Source Code:
 #include <cmath>
#include <cstdio>
#include <vector>
#include <iostream>
#include <algorithm>
using namespace std;
int main() {
/* Enter your code here. Read input from STDIN. Print output to STDOUT */
int t;
cin>>t;
while(t--){
int n,k,temp,cnt=0;
cin>>n>>k;
for(int i=0;i<n;i++){
cin>>temp;
if(temp<=0){
cnt++;
}
}
if(cnt>=k){
cout<<"NO"<<endl;
}else{
cout<<"YES"<<endl;
}
}
return 0;
}


** The above solution is my own code and it may not be the optimal solution or optimal way to approach the problem but it passes all the testcases in Hackerrank. So if you have any optimal approaches feel free to paste the code as the comment below..... :) :) :)