codefoce 158a next round （模拟水题) no.1

Next Round

传送
“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


#include<cstdio>
#include<algorithm>
#include<cstring>
#include<cmath>
using namespace std;
const int SIZE=10010;
int a[SIZE];
int n,k,ans,p; 
int (){
  int res=0,w=1;char ch;
 while(!isdigit(ch)&&ch!='-') ch=getchar();
    if(ch=='-') w=-1,ch=getchar();
  while(isdigit(ch)) res=res*10+ch-'0',ch=getchar();
    return res*w;
}
bool cmp(int a,int b){
  return a>b;
}
int main(){
  n=read();k=read();
   for(int i=1;i<=n;i++){
      a[i]=read();
 }
    sort(a+1,a+n+1,cmp);
 p=a[k];
  for(int i=1;i<=n;i++){
      if(a[i]>0&&a[i]>=p) ans++;
        else break;
    }
    cout<<ans<<endl;
 return 0;
}

codefoce 158a next round （模拟水题) no.1

Next Round

Input

Output

Examples

Note

题目大意：

做法：

代码：

近期文章

近期评论

标签

热门

文章归档

分类目录

功能