Next Round(codeforces)

/*

"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

*/ 


#include <bits/stdc++.h>

using namespace std;

int main(){

int n,k,i,cnt = 0;

scanf("%d %d",&n,&k);

int arr[n];

for(i=0;i<n;i++){

    scanf("%d",&arr[i]);

}

for(i=0;i<n;i++){

      if(arr[i] == 0)

        continue;

    if(arr[i] >= arr[k-1])

        cnt++;

}


printf("%d",cnt);


    return 0;

}


Comments

Post a Comment

Popular posts from this blog

Problem——50A. Domino piling——Codeforces

 /* ou are given a rectangular board of M × N squares. Also you are given an unlimited number of standard domino pieces of 2 × 1 squares. You are allowed to rotate the pieces. You are asked to place as many dominoes as possible on the board so as to meet the following conditions: Each domino completely covers two squares. No two dominoes overlap. Each domino lies entirely inside the board. It is allowed to touch the edges of the board. Find the maximum number of dominoes, which can be placed under these restrictions. Input In a single line you are given two integers M and N — board sizes in squares (1 ≤ M ≤ N ≤ 16). Output Output one number — the maximal number of dominoes, which can be placed. */ #include <bits/stdc++.h> using namespace std; int main(){ long int n,m; while(cin >> n >> m){     cout << n*m/2 << endl; }     return 0; }
Read more

Euclid’s lemma

  #include   <bits/stdc++.h> using   namespace   std ; /* If p divides x*y and p is relatively prime to x, then p must divide y. In the above example,  5 is relatively prime to 6, therefore it must divide 15.  */ int   main () { int   a , b , ab , p ; cin   >>   a   >>   b   >>   p ; ab  =  a * b ; if ( ab % p  ==  0 ){      if ( a % p  ==  0  ||  b % p  ==  0 )      cout   <<   "YES \n " ;      else      cout   <<   "NO \n " ; }           return   0 ; }
Read more