Submission #3601026
Source Code Expand
#n=int(input()) n,k=map(int,input().split()) x=[int(i) for i in input().split()] l,r=[],[] for i in x: if i<0: l.append(-i) if i>0: r.append(i) l.sort() r.sort() l=l[:n] r=r[:n] w=n-len(l) if len(l)==0 or len(r)==0: print(sum(l)+sum(r)) exit()
Submission Info
Submission Time | |
---|---|
Task | C - Candles |
User | nyon |
Language | PyPy3 (2.4.0) |
Score | 0 |
Code Size | 277 Byte |
Status | WA |
Exec Time | 226 ms |
Memory | 64024 KB |
Judge Result
Set Name | Sample | All | ||||||||
---|---|---|---|---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 0 / 300 | ||||||||
Status |
|
|
Set Name | Test Cases |
---|---|
Sample | 0_00.txt, 0_01.txt, 0_02.txt, 0_03.txt |
All | 0_00.txt, 0_01.txt, 0_02.txt, 0_03.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 |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
0_00.txt | WA | 166 ms | 38384 KB |
0_01.txt | WA | 165 ms | 38512 KB |
0_02.txt | AC | 163 ms | 38256 KB |
0_03.txt | WA | 163 ms | 38256 KB |
1_00.txt | WA | 221 ms | 61552 KB |
1_01.txt | WA | 221 ms | 61552 KB |
1_02.txt | WA | 226 ms | 64024 KB |
1_03.txt | WA | 223 ms | 64024 KB |
1_04.txt | WA | 217 ms | 62364 KB |
1_05.txt | WA | 217 ms | 62364 KB |
1_06.txt | WA | 219 ms | 61384 KB |
1_07.txt | WA | 222 ms | 61808 KB |