Skip to content

Latest commit

 

History

History

Topic Based Problems

Folders and files

NameName
Last commit message
Last commit date

parent directory

..
 
 
 
 

158A. Next Round

Problem statement:

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

Examples:

input
8 5
10 9 8 7 7 7 5 5
output
6

input
4 2
0 0 0 0
output
0

Note:

In the first example the participant on the 5th place earned 7 points. As the participant on the 6th place also earned 7 points, there are 6 advancers.

In the second example nobody got a positive score.

Algorithm:

The algorithm for solving this problem is as follows:

  1. Initialize a counter cnt to 0.
  2. For each participant, if their score is greater than or equal to the score of the k-th place finisher, then increment cnt by 1.
  3. Return cnt.

Pseudocode:

def next_round(n, k, scores):
  cnt = 0
  for score in scores:
    if score >= scores[k - 1]:
      cnt += 1
  return cnt

I hope this is helpful! Let me know if you have any other questions.