zoukankan      html  css  js  c++  java
  • A. 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 from1 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
    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.

    1 #include <iostream>
    2 int n,k,i,j,a[51];
    3 using namespace std;
    4 int main(){
    5     cin>>n>>k;
    6     while(n>i) cin>>a[i++];     //不一样的输入方式
    7     while (a[j]&&a[j]>=a[k-1])  ++j;
    8      cout<<j;
    9 }
  • 相关阅读:
    swoole入门abc
    PHP实现定时任务(非linux-shell方式,与操作系统无关)
    PHP经典算法题
    lumen使用CORS解决跨域问题
    轻松搞定 JS 的this、call和apply
    Nginx与PHP工作原理
    PHP的cURL扩展库使用详解
    PHP 中的 cURL 爬虫实战基础
    jvm误区--动态对象年龄判定
    从源码分析如何优雅的使用 Kafka 生产者
  • 原文地址:https://www.cnblogs.com/z-712/p/7307465.html
Copyright © 2011-2022 走看看