https://github.com/amitthecoder/next-round
https://github.com/amitthecoder/next-round
codeforces codeforces-problems codeforces-solutions codeforces-solutions-github kotlin
Last synced: about 1 month ago
JSON representation
- Host: GitHub
- URL: https://github.com/amitthecoder/next-round
- Owner: amitthecoder
- Created: 2024-10-08T01:12:42.000Z (7 months ago)
- Default Branch: main
- Last Pushed: 2024-10-08T01:17:00.000Z (7 months ago)
- Last Synced: 2025-03-19T12:17:52.970Z (about 2 months ago)
- Topics: codeforces, codeforces-problems, codeforces-solutions, codeforces-solutions-github, kotlin
- Language: Kotlin
- Homepage:
- Size: 2.93 KB
- Stars: 0
- Watchers: 1
- Forks: 0
- Open Issues: 0
-
Metadata Files:
- Readme: README.md
Awesome Lists containing this project
README
# Next Round
time limit per test - 3 seconds
memory limit per test - 256 megabytes
"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.