Submission #162358

#TimeUsernameProblemLanguageResultExecution timeMemory
162358boolodifjenulaAkcija (COCI15_akcija)Cpython 3
40 / 80
367 ms8352 KiB
n=int(input()) L=[int(input()) for i in range (n)] L.sort() z=0 for i in range (n): if i%3==0: continue else: z+=L[i] if n%3==1: z+=L[n-1] elif n%3==2: z+=L[n-1]+L[n-2] print(z)
#Verdict Execution timeMemoryGrader output
Fetching results...