加入收藏 | 设为首页 | 会员中心 | 我要投稿 李大同 (https://www.lidatong.com.cn/)- 科技、建站、经验、云计算、5G、大数据,站长网!
当前位置: 首页 > 站长学院 > PHP教程 > 正文

158A - Next Round

发布时间:2020-12-13 20:22:31 所属栏目:PHP教程 来源:网络整理
导读:A. Next Round time limit per test 3 seconds memory limit per test 256 megabytes input standard input output standard output Contestant who earns a score equal to or greater than the k -th place finisher's score will advance to the next rou
A. Next Round
time limit per test
3 seconds
memory limit per test
256 megabytes
input
standard input
output
standard 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 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.

import java.util.*; public class Main { public static void main(String[] args) { Scanner sc=new Scanner(System.in); int n=sc.nextInt(); int k=sc.nextInt(); int count=0; int[] score = new int[60]; for(int i=0;i<n;i++) score[i]=sc.nextInt(); int max=score[k⑴]; for(int i=0;i<n;i++) if(score[i]>=max&&score[i]>0) count++; System.out.println(count); } }


(编辑:李大同)

【声明】本站内容均来自网络,其相关言论仅代表作者个人观点,不代表本站立场。若无意侵犯到您的权利,请及时与联系站长删除相关内容!

    推荐文章
      热点阅读