166932025-05-08 19:10:00algoproLegnagyobb téglalappypy3Accepted 100/100134ms44660 KiB
# UUID: 31a45364-7b03-4206-87a6-fbf1cceb7f61
d= dict()
n =int(input())
w =[]
k =[int(x) for x in input().split()]
for i in range(n):
    if k[i] in d:
        d[k[i]]+=1
    else:
        d[k[i]] = 1
A= sorted(d.keys(), reverse = True)

for i in range(len(A)):
    if d[A[i]]>=2:
        w.append(A[i])
    if d[A[i]]>=4:
        w.append(A[i])
if len(w)<2:
    print(0)
else:
    ww=sorted(w)
    print(ww[-1]*ww[-2])
         
    
SubtaskSumTestVerdictTimeMemory
subtask10/0
1Accepted39ms19432 KiB
2Accepted43ms19440 KiB
3Accepted39ms19408 KiB
subtask210/10
4Accepted39ms19452 KiB
5Accepted39ms19532 KiB
6Accepted45ms19520 KiB
7Accepted43ms19352 KiB
8Accepted45ms19504 KiB
subtask310/10
9Accepted39ms19608 KiB
10Accepted45ms19716 KiB
11Accepted43ms19488 KiB
12Accepted39ms19356 KiB
13Accepted64ms31452 KiB
14Accepted72ms31208 KiB
subtask415/15
15Accepted45ms19524 KiB
16Accepted43ms19508 KiB
17Accepted39ms19432 KiB
18Accepted41ms19428 KiB
19Accepted46ms19608 KiB
20Accepted45ms19500 KiB
21Accepted39ms19424 KiB
22Accepted39ms19556 KiB
23Accepted46ms19436 KiB
24Accepted39ms19436 KiB
subtask520/20
25Accepted48ms21624 KiB
26Accepted57ms21824 KiB
27Accepted52ms21700 KiB
28Accepted57ms21716 KiB
29Accepted61ms21828 KiB
30Accepted61ms21756 KiB
31Accepted52ms21764 KiB
32Accepted57ms21484 KiB
subtask615/15
33Accepted43ms19484 KiB
34Accepted104ms39080 KiB
35Accepted90ms43284 KiB
36Accepted104ms43268 KiB
37Accepted90ms43320 KiB
38Accepted101ms43284 KiB
39Accepted92ms43324 KiB
40Accepted56ms21500 KiB
41Accepted79ms31980 KiB
subtask730/30
42Accepted83ms31924 KiB
43Accepted134ms44504 KiB
44Accepted115ms43784 KiB
45Accepted114ms43964 KiB
46Accepted131ms43800 KiB
47Accepted126ms43800 KiB
48Accepted115ms44472 KiB
49Accepted115ms44660 KiB
50Accepted101ms31980 KiB
51Accepted93ms31920 KiB