194692025-12-10 07:28:35VizsimiKét ajándékpython3Wrong answer 0/100328ms7224 KiB
N = int(input())
prizes = input().split()
for i in range(N):
  prizes[i] = int(prizes[i])
array= [0]

for i in range(N):
  highest = 0
  for j in range(1, N):
    if prizes[j] > prizes[highest]:
      highest = j
  if highest < prizes[i]:
    one = highest + 1
    two = prizes[i] + 1
    break
  array.append(highest + 1)
  prizes[highest] = 0
print(one, two)
SubtaskSumTestVerdictTimeMemory
subtask10/0
1Accepted16ms3124 KiB
2Wrong answer56ms6104 KiB
subtask20/10
3Wrong answer16ms3124 KiB
4Wrong answer16ms3120 KiB
5Wrong answer16ms2868 KiB
6Wrong answer16ms2868 KiB
7Wrong answer16ms3320 KiB
subtask30/10
8Wrong answer17ms3144 KiB
9Wrong answer16ms3004 KiB
10Wrong answer16ms3120 KiB
11Wrong answer17ms3124 KiB
12Wrong answer14ms2964 KiB
subtask40/20
13Wrong answer16ms3100 KiB
14Wrong answer16ms3136 KiB
15Wrong answer16ms2972 KiB
16Wrong answer14ms3124 KiB
17Wrong answer17ms3120 KiB
18Wrong answer16ms3124 KiB
19Wrong answer17ms3304 KiB
20Wrong answer17ms3124 KiB
21Wrong answer16ms3016 KiB
22Wrong answer16ms3124 KiB
subtask50/10
23Wrong answer59ms3380 KiB
24Wrong answer20ms3128 KiB
25Wrong answer21ms3576 KiB
26Wrong answer328ms3492 KiB
27Wrong answer27ms3636 KiB
subtask60/10
28Wrong answer21ms3892 KiB
29Wrong answer20ms4016 KiB
30Wrong answer21ms3896 KiB
31Wrong answer21ms3872 KiB
32Wrong answer21ms3892 KiB
subtask70/10
33Wrong answer35ms5624 KiB
34Wrong answer34ms5428 KiB
35Wrong answer34ms5532 KiB
36Wrong answer34ms5424 KiB
37Wrong answer34ms5420 KiB
subtask80/30
38Wrong answer43ms6288 KiB
39Wrong answer39ms6456 KiB
40Wrong answer43ms6356 KiB
41Wrong answer41ms6604 KiB
42Wrong answer43ms6908 KiB
43Wrong answer46ms6864 KiB
44Wrong answer48ms6812 KiB
45Wrong answer48ms6988 KiB
46Wrong answer45ms6888 KiB
47Wrong answer45ms6888 KiB
48Wrong answer46ms7044 KiB
49Wrong answer46ms7224 KiB
50Wrong answer48ms7028 KiB
51Wrong answer46ms7028 KiB
52Wrong answer43ms7024 KiB