Problem--158A--Codeforces--Next Round

最新推荐文章于 2022-04-12 11:02:18 发布

小兔叽的甜甜圈

最新推荐文章于 2022-04-12 11:02:18 发布

阅读量711

点赞数

分类专栏： Codeforces

本文链接：https://blog.csdn.net/qq_36667106/article/details/54632262

版权

该博客介绍了一个编程竞赛的资格赛规则，参赛者中得分等于或超过第k名分数且分数为正的人将晋级。输入包含参赛人数n、晋级分数线k以及所有参赛者的分数，输出晋级人数。博客提供了示例输入和输出，并提到有更简洁的解决方案。

摘要由CSDN通过智能技术生成

Next Round
time limit per test3 seconds
memory limit per test256 megabytes
inputstandard input
outputstandard output

“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