Monday, 29 November 2021

Next Round Problem !!!

 PROBLEM 25: Next Round


Problem Reference : Codeforces 

"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.


Solution: 


  1. n , k = input().split()
  2. b = 0
  3. c = [int(x) for x in input().split()]
  4. for i in c:
  5. if i >= c[int(k)-1] and i > 0 :
  6. b = b + 1
  7. print(b)



The above solution is in python language.



Examples
input
8 5
10 9 8 7 7 7 5 5
output
6
input
4 2
0 0 0 0
output
0

No comments:

Post a Comment

Rearrange an array with O(1) extra space

  PROBLEM 61:  Rearrange an array with O(1) extra space (For best view experience, view in windows version) Problem Reference : GeeksForGeek...