codeforces 158A Next Round

最新推荐文章于 2023-05-12 11:52:34 发布

原创最新推荐文章于 2023-05-12 11:52:34 发布 · 331 阅读

0 ·

本内容遵循CC 4.0 BY-SA版权协议

标签

#codeforces

codeforces刷題篇专栏收录该内容

43 篇文章

订阅专栏

本文介绍了一个简单的算法，用于计算竞赛中根据得分晋级下一轮的人数。输入包括参赛者总数、晋级名额及各参赛者的得分，输出晋级人数。文章包含一个C++实现示例。

"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 andk (1 ≤ k ≤ n ≤ 50) separated by a single space.

The second line contains n space-separated integersa₁, a₂, ..., a_n (0 ≤ a_i ≤ 100), where a_i is the score earned by the participant who got thei-th place. The given sequence is non-increasing (that is, for alli from 1 to n - 1 the following condition is fulfilled: a_i ≥ a_i + 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

Input

4 2
0 0 0 0

Output

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.

AC:

#include<bits/stdc++.h>
using namespace std;
int main()
{
   int ch[55],k,n,j;
   cin>>n>>k;
   j=1;
   k--;
   memset(ch,0,sizeof(ch));
   for(int i=0;i<n;i++)
       scanf("%d",&ch[i]);
   while(k<n)
   {
       if(ch[k+j]==ch[k])
           k++;
       else
           break;
   }
   while(ch[k]<=0&&k>=0)
       k--;
   cout<<k+1<<endl;
}
水题