| Run ID | Author | Problem | Lang | Verdict | Time | Memory | Code Length | Submit Time |
|---|---|---|---|---|---|---|---|---|
| 18405 | 马德理666 | 石子 | Python3 | Accepted | 27 MS | 3680 KB | 271 | 2023-05-27 12:11:10 |
n = int(input()) ls = [int(i) for i in input().split()] avg = sum(ls) // n for i in range(n): if i == 0: ls[i] -= avg else: ls[i] -= avg ls[i] += ls[i-1] ls.sort() tot = 0 for x in ls: tot += abs(x - ls[n // 2]) print(tot)