728x90
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 | import java.io.BufferedReader; import java.io.BufferedWriter; import java.io.IOException; import java.io.InputStreamReader; import java.io.OutputStreamWriter; import java.util.StringTokenizer; public class Solution { private static BufferedReader br = new BufferedReader(new InputStreamReader(System.in)); private static BufferedWriter bw = new BufferedWriter(new OutputStreamWriter(System.out)); public static void main(String[] args) throws IOException{ StringTokenizer stk = new StringTokenizer(br.readLine()); int N = Integer.parseInt(stk.nextToken()); int K = Integer.parseInt(stk.nextToken()); String[] point = br.readLine().split(" "); int num_k = Integer.parseInt(point[K-1]); int result = 0; for(int i=0; i<N; i++) { int num_i = Integer.parseInt(point[i]); if(num_i>0) { if(num_i>=num_k) result++; else break; } else break; } System.out.println(result); } } | cs |
'알고리즘 풀이 > CodeForces' 카테고리의 다른 글
[CodeForces][JAVA] 118A - String Task (0) | 2021.06.20 |
---|---|
[CodeForces][JAVA] 282A. Bit++ (0) | 2021.06.20 |
[CodeForces][JAVA] 1A - Theatre Square (0) | 2021.06.08 |
[CodeForces][JAVA] 231A. Team (0) | 2021.06.08 |
[CodeForces][JAVA] 71A. Way Too Long Words (0) | 2021.06.08 |