Submission #7969515

Source Code Expand

n, k = map(int, input().split())
h = list(map(int, input().split()))
count = 0
for h_i in h:
    if h_i >= k:
        count += 1
print(count)

Submission Info

Submission Time
Task B - Roller Coaster
User threepipes_s
Language Python (3.4.3)
Score 200
Code Size 149 Byte
Status AC
Exec Time 47 ms
Memory 11908 KiB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 200 / 200
Status
AC × 3
AC × 16
Set Name Test Cases
Sample 00-sample-01.txt, 00-sample-02.txt, 00-sample-03.txt
All 00-sample-01.txt, 00-sample-02.txt, 00-sample-03.txt, 01-small-01.txt, 01-small-02.txt, 01-small-03.txt, 01-small-04.txt, 01-small-05.txt, 03-near-01.txt, 03-near-02.txt, 03-near-03.txt, 04-narrow-01.txt, 04-narrow-02.txt, 04-narrow-03.txt, 05-max-01.txt, 05-max-02.txt
Case Name Status Exec Time Memory
00-sample-01.txt AC 16 ms 2940 KiB
00-sample-02.txt AC 16 ms 2940 KiB
00-sample-03.txt AC 17 ms 2940 KiB
01-small-01.txt AC 17 ms 2940 KiB
01-small-02.txt AC 16 ms 2940 KiB
01-small-03.txt AC 16 ms 2940 KiB
01-small-04.txt AC 16 ms 2940 KiB
01-small-05.txt AC 17 ms 2940 KiB
03-near-01.txt AC 36 ms 8684 KiB
03-near-02.txt AC 42 ms 11580 KiB
03-near-03.txt AC 37 ms 9748 KiB
04-narrow-01.txt AC 35 ms 7872 KiB
04-narrow-02.txt AC 44 ms 10036 KiB
04-narrow-03.txt AC 40 ms 9012 KiB
05-max-01.txt AC 47 ms 11896 KiB
05-max-02.txt AC 47 ms 11908 KiB