A. Next Round

最新推荐文章于 2020-12-02 21:49:17 发布
最新推荐文章于 2020-12-02 21:49:17 发布
阅读量212 收藏
点赞数
分类专栏： codeforces(CF) 文章标签： 算法
版权声明：本文为博主原创文章，遵循 CC 4.0 BY-SA 版权协议，转载请附上原文出处链接和本声明。
本文链接：https://blog.csdn.net/weixin_45696526/article/details/105628202
版权
一篇关于编程竞赛晋级规则的解析文章，介绍了当分数达到第k名选手水平且得分大于0时，参赛者可以晋级。文章提供了输入输出示例，并解释了如何计算晋级人数。
摘要由CSDN通过智能技术生成

题目

“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 1 ≤ k ≤ n ≤ 50 1 ≤ k ≤ n ≤ 50) separated by a single space.The second line contains n space-separated integers a 1 ,  

最低0.47元/天 解锁文章
rainbow_赵璇
关注
  • 0
    点赞
  • 踩
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论
专栏目录
Next Round
wang20142052的博客
11-02 1498
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 gre
A. Next Round【难度: 水题 / 知识点: 模拟】
bettle_king的博客
09-08 146
https://codeforces.com/problemset/problem/158/A #include<bits/stdc++.h> using namespace std; const int N=1e5+10; int n,m,cnt,s[N]; int main(void) { cin>>n>>m; for(int i=1;i<=n;i++) cin>>s[i]; int temp=s[m]; for(int i=1;i<.
158A.Next Round
Mr_L_K的博客
12-02 225
158A.Next Round题目翻译题目输入输出分析代码 题目 翻译 题目     “分数大于0且大于等于第k名选手分数的选手将晋级下一轮…” 一 比赛规则摘录。      总共有n名参加者参与了比赛(n ≥ k)，并且你已经知道了他们的分数，算一下有多少名参加者紧急下一轮吧。 输入     第一行输入2个整数n和k（1 ≤ k ≤ n ≤ 50）并由单空格分隔开。  &nb
158A - Next Round
Cai_Haiq的博客
12-18 540
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
青少新概念2A知识点.doc
10-08
1. **四会词汇**：这些词汇是学生必须掌握的核心单词，例如`next to`（紧靠…旁边），`wait for`（等待），`come round`（来到附近），`stand up`（起立），`come out`（出来），`sit`（坐），`phone`（电话），`TV`...
hls.min.js
06-01
return i/=45,r&&(i+=47721858.84),Math.round(i)}},t._decodePrivFrame=function(e){if(!(e.size)){var r=t._utf8ArrayToStr(e.data),i=new Uint8Array(e.data.subarray(r.length+1));return{key:e.type,info:r,...
出现问题a is defined高手帮忙
06-15
buttonZoomingHTML: 'Drag a region on the map', buttonZoomingStyle: {background: '#FF0'}, overlayRemoveTime: 6000, backButtonEnabled: false, stickyZoomEnabled: false, rightMouseZoomOutEnabled: ...
tweenjs.min.js文件
08-06
0,this._next=null,this._prev=null,this._parent=null,this._labels=null,this._labelList=null,a&&(this.useTicks=!!a.useTicks,this.ignoreGlobalPause=!!a.ignoreGlobalPause,this.loop=a.loop===!0?-1:a.loop||...
oracle函数大全.doc
09-16
SQL> select ascii('A') A,ascii('a') a,ascii('0') zero,ascii(' ') space from dual; A A ZERO SPACE --------- --------- --------- --------- 65 97 48 32 2.CHR 给出整数,返回对应的字符; SQL> select chr...
Codeforces Round #350 (Div. 2)easy
妍恐龙的博客....^~^眼熟我
05-06 1109
A: A. Holidays time limit per test 1 second memory limit per test 256 megabytes input standard input output standard output On the planet Mars a year lasts exactly n days (ther
CodeForces - 670D2 Magic Powder - 2（二分）
Chook_lxk的博客
07-21 485
点击打开题目链接 D2. Magic Powder - 2 time limit per test 1 second memory limit per test 256 megabytes input standard input output standard output The term of this problem
codeforces 670D2
chen20000804的博客
07-20 331
D2. Magic Powder - 2 time limit per test1 second memory limit per test256 megabytes inputstandard input outputstandard output The term of this problem is the same as the previous one, the only exc
Codeforces Round #277 (Div. 2) 题解
码代码的猿猿
11-13 1775
Codeforces Round #277 (Div. 2) A. Calculating Function time limit per test 1 second memory limit per test 256 megabytes input standard input output standard outp
Codeforces Round #350 (Div. 2)_D2 - Magic Powder - 2
bin_gege的博客
05-06 458
D2. Magic Powder - 2 time limit per test 1 second memory limit per test 256 megabytes input standard input output standard output The term of this problem is the same as
二分图_1
xinda的博客
08-06 330
Description Recently, Pari and Arya did some research about NP-Hard problems and they found the minimum vertex cover problem very interesting. Suppose the graph G is given. Subset A of its vertice
B. Permutation
无知的我
12-18 1437
time limit per test 1 second memory limit per test 256 megabytes input standard input output standard output A permutation p is an ordered group of numbers p1,   p2,   ...,  
codeforces670D2 Magic Powder - 2 （二分)
hkh746392783的专栏
05-07 1369
题目链接 http://codeforces.com/problemset/problem/670/D2 D2. Magic Powder - 2 time limit per test 1 second memory limit per test 256 megabytes input standard input ou
bigdecimal.Round_UP
最新发布
04-04
This rounding mode rounds towards positive infinity, so any value with a non-zero fractional part will be rounded up to the next highest value. Here's an example: ```java import java.math....
评论
添加红包

请填写红包祝福语或标题

个

红包个数最小为10个

元

红包金额最低5元

当前余额3.43元 前往充值 >
需支付：10.00元
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付元
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明：

1.余额是钱包充值的虚拟货币，按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载，可以购买VIP、付费专栏及课程。

余额充值