Submission #27805883

Source Code Expand

N,Q=map(int,input().split())
A=[(a,10**9) for a in map(int,input().split())]
X=[]
for i in range(Q):
  x=int(input())
  X.append((x,i))

AX=sorted(A+X)[::-1]

ans=[0]*Q
cnt=0
for x,i in AX:
  if i<Q:
    ans[i]=cnt
  else:
    cnt+=1

print(*ans,sep="\n")

Submission Info

Submission Time
Task C - Counting 2
User kyopro_friends
Language Python (3.8.2)
Score 300
Code Size 274 Byte
Status AC
Exec Time 882 ms
Memory 67884 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 881 ms 67596 KiB
case_01.txt AC 875 ms 67868 KiB
case_02.txt AC 868 ms 67608 KiB
case_03.txt AC 882 ms 67620 KiB
case_04.txt AC 870 ms 67884 KiB
case_05.txt AC 515 ms 42384 KiB
case_06.txt AC 530 ms 42368 KiB
case_07.txt AC 440 ms 43924 KiB
case_08.txt AC 332 ms 43008 KiB
case_09.txt AC 821 ms 64436 KiB
case_10.txt AC 514 ms 46556 KiB
case_11.txt AC 292 ms 29860 KiB
case_12.txt AC 212 ms 25444 KiB
case_13.txt AC 557 ms 44832 KiB
case_14.txt AC 474 ms 43844 KiB
case_15.txt AC 516 ms 47504 KiB
case_16.txt AC 552 ms 45504 KiB
sample_00.txt AC 18 ms 8864 KiB
sample_01.txt AC 19 ms 9088 KiB
sample_02.txt AC 17 ms 9084 KiB