l = [0, 2, 0, 2, 5 ,5 ,6 ,7 ,10, 3, 4, 3]
c = []
def find_values(l, k=1):
c = l[:k]
c.sort() (此处省事直接选择了内建函数的排序方法)
for i in range(k, len(l)):
min_value = i
for j in range(len(c)-1, 1, -1):
print j
if l[min_value] < c[j]:
c[j] = l[min_value]
break
return c
print find_values(l, 6)