Submission #3768897

Source Code Expand

n,l = map(int,input().split())
a = map(int,input().split())
a.sort()
if a[n - 1] + a[n - 2] >= l:
  print("Possible")
else:
  print("Impossible")

Submission Info

Submission Time
Task C - Knot Puzzle
User mikit
Language Python (3.4.3)
Score 0
Code Size 151 Byte
Status RE
Exec Time 30 ms
Memory 11132 KB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 0 / 500
Status
RE × 3
RE × 35
Set Name Test Cases
Sample 0_00.txt, 0_01.txt, 0_02.txt
All 0_00.txt, 0_01.txt, 0_02.txt, 1_00.txt, 1_01.txt, 1_02.txt, 1_03.txt, 1_04.txt, 1_05.txt, 1_06.txt, 1_07.txt, 1_08.txt, 1_09.txt, 1_10.txt, 1_11.txt, 1_12.txt, 1_13.txt, 1_14.txt, 1_15.txt, 1_16.txt, 1_17.txt, 1_18.txt, 1_19.txt, 1_20.txt, 1_21.txt, 1_22.txt, 1_23.txt, 1_24.txt, 1_25.txt, 1_26.txt, 1_27.txt, 1_28.txt, 1_29.txt, 1_30.txt, 1_31.txt
Case Name Status Exec Time Memory
0_00.txt RE 18 ms 2940 KB
0_01.txt RE 18 ms 2940 KB
0_02.txt RE 18 ms 2940 KB
1_00.txt RE 18 ms 2940 KB
1_01.txt RE 18 ms 2940 KB
1_02.txt RE 20 ms 4080 KB
1_03.txt RE 20 ms 4080 KB
1_04.txt RE 20 ms 4324 KB
1_05.txt RE 20 ms 4324 KB
1_06.txt RE 21 ms 4080 KB
1_07.txt RE 20 ms 4324 KB
1_08.txt RE 20 ms 4080 KB
1_09.txt RE 20 ms 4080 KB
1_10.txt RE 20 ms 4080 KB
1_11.txt RE 20 ms 4328 KB
1_12.txt RE 28 ms 11072 KB
1_13.txt RE 28 ms 11064 KB
1_14.txt RE 28 ms 11132 KB
1_15.txt RE 18 ms 2940 KB
1_16.txt RE 18 ms 2940 KB
1_17.txt RE 29 ms 10784 KB
1_18.txt RE 28 ms 10800 KB
1_19.txt RE 30 ms 10996 KB
1_20.txt RE 27 ms 10380 KB
1_21.txt RE 28 ms 11004 KB
1_22.txt RE 27 ms 10688 KB
1_23.txt RE 27 ms 10688 KB
1_24.txt RE 28 ms 10288 KB
1_25.txt RE 28 ms 10964 KB
1_26.txt RE 28 ms 10480 KB
1_27.txt RE 28 ms 10772 KB
1_28.txt RE 28 ms 10828 KB
1_29.txt RE 27 ms 10268 KB
1_30.txt RE 28 ms 10788 KB
1_31.txt RE 27 ms 10368 KB