163892025-04-29 10:48:35algoproLegnagyobb téglalappypy3Accepted 100/10094ms31980 KiB
# UUID: 978b266d-3979-4781-adb2-6bf97691c787
N=int(input())
A=[int(x) for x in input().split()]
A.sort()
r=set()
cur = N-1
found=[]
while cur > 0:
    if A[cur]==A[cur-1]:
        found.append(A[cur])
        if len(found)>=2:
            print(found[-1]*found[-2])
            exit()
        cur-=2
    else:
        cur-=1


print(0)
SubtaskSumTestVerdictTimeMemory
subtask10/0
1Accepted43ms19432 KiB
2Accepted39ms19404 KiB
3Accepted39ms19428 KiB
subtask210/10
4Accepted45ms19460 KiB
5Accepted43ms19432 KiB
6Accepted39ms19388 KiB
7Accepted39ms19436 KiB
8Accepted39ms19436 KiB
subtask310/10
9Accepted43ms19332 KiB
10Accepted43ms19500 KiB
11Accepted39ms19400 KiB
12Accepted39ms19428 KiB
13Accepted68ms31204 KiB
14Accepted65ms31432 KiB
subtask415/15
15Accepted43ms19328 KiB
16Accepted46ms19360 KiB
17Accepted39ms19440 KiB
18Accepted39ms19428 KiB
19Accepted39ms19432 KiB
20Accepted45ms19436 KiB
21Accepted43ms19432 KiB
22Accepted39ms19468 KiB
23Accepted46ms19436 KiB
24Accepted39ms19492 KiB
subtask520/20
25Accepted46ms21380 KiB
26Accepted54ms21448 KiB
27Accepted54ms21632 KiB
28Accepted48ms21464 KiB
29Accepted56ms21460 KiB
30Accepted54ms21516 KiB
31Accepted48ms21572 KiB
32Accepted46ms21444 KiB
subtask615/15
33Accepted39ms19516 KiB
34Accepted71ms31096 KiB
35Accepted74ms31276 KiB
36Accepted74ms31124 KiB
37Accepted64ms31212 KiB
38Accepted64ms31252 KiB
39Accepted72ms31212 KiB
40Accepted52ms21320 KiB
41Accepted63ms31980 KiB
subtask730/30
42Accepted89ms31808 KiB
43Accepted92ms31120 KiB
44Accepted85ms31100 KiB
45Accepted85ms31172 KiB
46Accepted94ms31212 KiB
47Accepted86ms31252 KiB
48Accepted90ms31208 KiB
49Accepted83ms31164 KiB
50Accepted90ms31976 KiB
51Accepted82ms31944 KiB