-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathnextRound.cpp
More file actions
37 lines (33 loc) · 1.05 KB
/
Copy pathnextRound.cpp
File metadata and controls
37 lines (33 loc) · 1.05 KB
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
/*"Contestant who earns a score equal to or greater than the k-th place finisher's score will advance to the next round, as long as the contestant earns a positive score..." — an excerpt from contest rules.
A total of n participants took part in the contest (n = k), and you already know their scores. Calculate how many participants will advance to the next round.
Input
The first line of the input contains two integers n and k (1 = k = n = 50) separated by a single space.
The second line contains n space-separated integers a1, a2, ..., an (0 = ai = 100), where ai is the score earned by the participant who got the i-th place. The given sequence is non-increasing (that is, for all i from 1 to n - 1 the following condition is fulfilled: ai = ai + 1).
input:
8 5
10 9 8 7 7 7 5 5
output:
6
input:
4 2
0 0 0 0
output:
0
*/
#include<iostream>
using namespace std;
int main(){
int n,k,counter=0;
cin>>n>>k;
int arr[n];
for(int i=0;i<n;i++){
cin>>arr[i];
}
for(int i=0;i<n;i++){
if(arr[k-1]<=arr[i] && arr[i]>0){
counter++;
}
}
cout<<counter;
return 0;
}