Submission #3598013
Source Code Expand
def inpl(): return [int(i) for i in input().split()] W, H = inpl() p = [(int(input()), 0) for _ in range(W)] q = [(int(input()), 1) for _ in range(H)] pq = sorted(p+q) cW = W+1 cH = H+1 ans = 0 for i, j in pq: if j == 1: ans += i*cW cH -= 1 else: ans += i*cH cW -= 1 print(ans)
Submission Info
Submission Time | |
---|---|
Task | C - Gr-idian MST |
User | Tallfall |
Language | Python (3.4.3) |
Score | 500 |
Code Size | 334 Byte |
Status | AC |
Exec Time | 745 ms |
Memory | 27748 KB |
Judge Result
Set Name | Sample | All | ||||
---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 500 / 500 | ||||
Status |
|
|
Set Name | Test Cases |
---|---|
Sample | s1.txt, s2.txt |
All | 01.txt, 02.txt, 03.txt, 04.txt, 05.txt, 06.txt, 07.txt, 08.txt, 09.txt, 10.txt, 11.txt, 12.txt, 13.txt, 14.txt, 15.txt, 16.txt, 17.txt, 18.txt, 19.txt, 20.txt, 21.txt, 22.txt, 23.txt, 24.txt, 25.txt, 26.txt, 27.txt, 28.txt, s1.txt, s2.txt |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
01.txt | AC | 731 ms | 27616 KB |
02.txt | AC | 745 ms | 27612 KB |
03.txt | AC | 712 ms | 27748 KB |
04.txt | AC | 711 ms | 27628 KB |
05.txt | AC | 739 ms | 27632 KB |
06.txt | AC | 729 ms | 27540 KB |
07.txt | AC | 740 ms | 27600 KB |
08.txt | AC | 724 ms | 27644 KB |
09.txt | AC | 725 ms | 27604 KB |
10.txt | AC | 737 ms | 27732 KB |
11.txt | AC | 597 ms | 27588 KB |
12.txt | AC | 590 ms | 27624 KB |
13.txt | AC | 448 ms | 27672 KB |
14.txt | AC | 698 ms | 27224 KB |
15.txt | AC | 648 ms | 27732 KB |
16.txt | AC | 363 ms | 15364 KB |
17.txt | AC | 352 ms | 15396 KB |
18.txt | AC | 343 ms | 15380 KB |
19.txt | AC | 360 ms | 15388 KB |
20.txt | AC | 414 ms | 20512 KB |
21.txt | AC | 555 ms | 24092 KB |
22.txt | AC | 534 ms | 24456 KB |
23.txt | AC | 467 ms | 27552 KB |
24.txt | AC | 445 ms | 26792 KB |
25.txt | AC | 18 ms | 3060 KB |
26.txt | AC | 18 ms | 3064 KB |
27.txt | AC | 18 ms | 3064 KB |
28.txt | AC | 18 ms | 3064 KB |
s1.txt | AC | 18 ms | 3060 KB |
s2.txt | AC | 18 ms | 3064 KB |