Submission #27843564

Source Code Expand

N,Q=map(int, input().split())
A=list(map(int, input().split()))
X=[]
for i in range(Q):
    X.append([int(input()),i])

A=sorted(A)
X=sorted(X,key=lambda x:x[0])

cp=0
for i in range(Q):
    x=X[i][0]
    while cp<N+2:
        if cp>=N:
            X[i].append(0)
            break
        if x<=A[cp]:
            X[i].append(N-cp)
            break
        else:
            cp+=1

X=sorted(X,key=lambda x:x[1])
for i in range(Q):
    print(X[i][2])

Submission Info

Submission Time
Task C - Counting 2
User nic_am
Language Python (3.8.2)
Score 300
Code Size 477 Byte
Status AC
Exec Time 991 ms
Memory 67492 KiB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 300 / 300
Status
AC × 3
AC × 20
Set Name Test Cases
Sample sample_00.txt, sample_01.txt, sample_02.txt
All case_00.txt, case_01.txt, case_02.txt, case_03.txt, case_04.txt, case_05.txt, case_06.txt, case_07.txt, case_08.txt, case_09.txt, case_10.txt, case_11.txt, case_12.txt, case_13.txt, case_14.txt, case_15.txt, case_16.txt, sample_00.txt, sample_01.txt, sample_02.txt
Case Name Status Exec Time Memory
case_00.txt AC 987 ms 67292 KiB
case_01.txt AC 989 ms 67300 KiB
case_02.txt AC 977 ms 67292 KiB
case_03.txt AC 983 ms 67492 KiB
case_04.txt AC 991 ms 67296 KiB
case_05.txt AC 771 ms 52648 KiB
case_06.txt AC 774 ms 52836 KiB
case_07.txt AC 484 ms 39560 KiB
case_08.txt AC 275 ms 30784 KiB
case_09.txt AC 917 ms 64816 KiB
case_10.txt AC 656 ms 50640 KiB
case_11.txt AC 390 ms 34500 KiB
case_12.txt AC 233 ms 24368 KiB
case_13.txt AC 823 ms 58680 KiB
case_14.txt AC 504 ms 41476 KiB
case_15.txt AC 484 ms 39704 KiB
case_16.txt AC 812 ms 58732 KiB
sample_00.txt AC 18 ms 9000 KiB
sample_01.txt AC 17 ms 9128 KiB
sample_02.txt AC 23 ms 8980 KiB