-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathNextRound.cpp
45 lines (35 loc) · 1.27 KB
/
NextRound.cpp
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
37
38
39
40
41
42
43
44
45
/* "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).
Output
Output the number of participants who advance to the next round.*/
#include <iostream>
using namespace std;
int main()
{
int n, k, h;
int b = 0;
int a[50];
cin >> n >> k;
k = k - 1;
for(int i = 0; i < n; i++){
cin >> a[i];
}
if(a[0] == 0){
cout << 0;
return 0;
}
for(int j = 0; j < n; j++){
if(a[k] <= a[j] && a[j] > 0){
b++;
}
}
cout << b;
return 0;
}