题目链接:https://codeforces.com/problemset/problem/158/A
题目描述:
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.
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.
思路:得分非正数直接跳过,因为序列是非增的,所以第k个数及之前的正数直接计算在内,第k个数之后的与第k个数相等的可计算在内。
代码:
#include<iostream>
using namespace std;
int main(){
int n,k;
cin>>n>>k;
int count=0,flag;
for(int i=1;i<=n;i++){
int a;
cin>>a;
if(a<=0)
continue;
if(i<k){
count++;
}
else
if(i==k){
flag=a;
count++;
}
else{
if(a==flag)
count++;
}
}
cout<<count;
}
有用的英文单词:
positive 正数的 excerpt 节选 non-increasing 非增