/ SeriousOJ /

Record Detail

Time Exceeded


  
# Status Time Cost Memory Cost
#1 Accepted 14ms 3.078 MiB
#2 Time Exceeded ≥2085ms ≥17.215 MiB
#3 Time Exceeded ≥2088ms ≥17.203 MiB
#4 Time Exceeded ≥2080ms ≥17.219 MiB
#5 Time Exceeded ≥2083ms ≥17.203 MiB
#6 Time Exceeded ≥2050ms ≥17.227 MiB
#7 Time Exceeded ≥2083ms ≥16.848 MiB
#8 Time Exceeded ≥2081ms ≥15.219 MiB
#9 Time Exceeded ≥2093ms ≥9.668 MiB
#10 Time Exceeded ≥2086ms ≥7.621 MiB
#11 Time Exceeded ≥2081ms ≥12.254 MiB
#12 Time Exceeded ≥2085ms ≥5.781 MiB

Code

n=int(input())
liN=list(map(int,input().split()))
m=int(input())
liM=list(map(int,input().split()))
res=[]
res=liN+liM
res.sort(reverse=True)
#print(res)
b=0
for i in range(len(liM)):
    if liM.count(liM[i])==1:
        idx=res.index(liM[i])+1+liN.count(liM[i])
        print(idx,end=" ")
    else:
        idx=res.index(liM[i])+1+liN.count(liM[i])+b
        print(idx,end=" ")
        b+=1








Information

Submit By
Type
Submission
Problem
P1049 Combined scoreboard
Contest
Brain Booster #3
Language
Python 3 (Python 3.12.3)
Submit At
2024-05-06 16:24:17
Judged At
2024-10-03 13:50:21
Judged By
Score
5
Total Time
≥2093ms
Peak Memory
≥17.227 MiB