Submission #1231058

---

Source Code Expand

#!/usr/bin/env python
# coding=utf-8
# __author__ = '小美'

n,k = map(int,raw_input().split())
a = [i for i in raw_input().split()]

#按照从左到右找出最大的K的序列
lis = []
i = 0
while i < k:
    max = a[0]
    for q in a:
        if q>max:
            max = q
    lis.append(max)
    a.remove(max)
    i+=1
sum = 0
for i in range(1,len(lis)):
    if lis[i]<=lis[i-1]:
        sum += int(lis[i-1])+1-int(lis[i])
        lis[i] = str(int(lis[i-1])+1)
print sum

Submission Info

Judge Result