next round
来源:互联网 发布:淘宝买家评价怎么看 编辑:程序博客网 时间:2024/06/03 15:35
"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.
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 the number of participants who advance to the next round.
幼儿园级别的题目
#include<stdio.h>int main(){ int n, k, i = 0, sum = 0; int p[50]; scanf ("%d%d", &n, &k); while (n-- > 0) { scanf ("%d", &p[i]); i++; } int t=0; for (; t<i; t++) { if (p[t] > 0 && p[t] >= p[k-1]) { sum++; } } printf ("%d\n", sum); return 0;}
- Next Round
- Next Round
- next round
- A. Next Round
- 158A - Next Round
- 158A Next Round
- codeforce158A Next Round
- CF——Next Round
- CF#158A Next Round
- CodeForces 158A Next Round
- codeforces 158A Next Round
- 选手“晋级” advance to the next round
- 2013资格赛——Next Round
- codeforces 158A Next Round(水题)
- codeforces 158A Next Round (水题)
- code Forces 158A Next Round
- Problem--158A--Codeforces--Next Round
- CodeForces.158A Next Round (水模拟)
- node安装node-sass失败,配置淘宝源
- HRMP项目总结
- 基于proteus的51单片机仿真实例三十五、C语言的continue语句
- JAVA基础知识-OOM怎么办
- 《工业控制系统信息安全防护指南》产品措施匹配表
- next round
- Android 支付宝支付功能封装实现
- 基于proteus的51单片机仿真实例三十六、C语言的函数返回值
- 状态压缩 Lights Against Dudely
- Spring Boot(一) 简介
- GCC:程序编译
- Android Studio Run App 不能自动启动
- python 含中文的json格式文件输出
- 脾和胃各自的功能是什么?