Submission #3024389
Source Code Expand
l = [int(i) for i in input().split()] ans = 0 for i in range(len(l) - 1): if l[i+1] < l[i]: tmp = l[i+1] l[i+1] = l[i] l[i] = tmp for i in range(len(l) - 1): ans += l[i+1] - l[i] print(ans)
Submission Info
Submission Time | |
---|---|
Task | A - Task Scheduling Problem |
User | hktech |
Language | Python (3.4.3) |
Score | 0 |
Code Size | 226 Byte |
Status | WA |
Exec Time | 17 ms |
Memory | 3064 KB |
Judge Result
Set Name | Sample | All | ||||||
---|---|---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 0 / 100 | ||||||
Status |
|
|
Set Name | Test Cases |
---|---|
Sample | sample_01, sample_02, sample_03 |
All | 0_small_rand_0, 0_small_rand_1, 0_small_rand_2, 0_small_rand_3, 1_rand_0, 1_rand_1, 1_rand_2, 1_rand_3, 2_hand_0, 2_hand_1, sample_01, sample_02, sample_03 |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
0_small_rand_0 | AC | 17 ms | 2940 KB |
0_small_rand_1 | WA | 17 ms | 3064 KB |
0_small_rand_2 | AC | 17 ms | 3060 KB |
0_small_rand_3 | AC | 17 ms | 2940 KB |
1_rand_0 | WA | 17 ms | 2940 KB |
1_rand_1 | WA | 17 ms | 3060 KB |
1_rand_2 | AC | 17 ms | 2940 KB |
1_rand_3 | WA | 17 ms | 2940 KB |
2_hand_0 | AC | 17 ms | 3060 KB |
2_hand_1 | AC | 17 ms | 2940 KB |
sample_01 | AC | 17 ms | 3060 KB |
sample_02 | AC | 17 ms | 3060 KB |
sample_03 | AC | 17 ms | 3060 KB |