codeforces 158A Next Round （水题）

最新推荐文章于 2024-08-31 10:23:18 发布

Notdeep__acm

最新推荐文章于 2024-08-31 10:23:18 发布

阅读量1.4k

点赞数

CC 4.0 BY-SA版权

本文链接：https://blog.youkuaiyun.com/Notdeep__acm/article/details/38477071

简单模拟专栏收录该内容

19 篇文章

订阅专栏

本文介绍了一种计算竞赛晋级人数的方法，参与者总数为n，已知各参赛者的得分，需找出分数等于或超过第k名选手的所有选手数量。示例包括输入输出样例及简单代码实现。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

题目：

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

Sample test(s)

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.

题意分析：

有n个数字，计算大于等于第k个数的个数。水题，不解释

代码：

#include<iostream>
int n,k,i,j,a[51];
using namespace std;
int main()
{
    cin>>n>>k;
    while(n>i)  cin>>a[i++];
    while(a[j]&&a[j]>=a[k-1])++j;
    cout<<j;
}