본문 바로가기
Algorithm

cordforces - A. Next Round

by Doromi 2018. 1. 24.
728x90
반응형

"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 aiis 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
cpp 나의 솔루션

 

#include<iostream>
#include<string>
using namespace std;

int main() {
 int participant[50];
 int n, k, k_th;
 int count = 0;

 cin >> n >> k;

 for (int i = 0; i < n; i++) {
  cin >> participant[i];
  if (i + 1 == k)
   k_th = participant[i];
 }
 for (int i = 0; i < n; i++) {
  if (participant[i] >= k_th && participant[i]>0) {
   count++;
  }
 }
 cout << count << endl;
}

728x90
반응형

'Algorithm' 카테고리의 다른 글

해시, 해시테이블  (0) 2019.04.18
정렬 알고리즘  (0) 2019.04.18
자료구조와 알고리즘  (0) 2019.04.18
알고리즘 코드는 깃에....  (0) 2019.04.01
cordforces - A. Theatre Square  (0) 2018.01.24