最小的k个数

# coding:utf-8
class Solution:
    def GetLeastNumbers_Solution(self, tinput, k):
        # write code here
        for i in range(len(tinput)-1, 0, -1):
            for j in range(i):
                if tinput[j] > tinput[j+1]:
                    tinput[j], tinput[j+1] = tinput[j+1], tinput[j]
        if 0 < k <= len(tinput):
            return tinput[0:k]
        else:
            return []


p = Solution()
ret = p.GetLeastNumbers_Solution([2,1,3],3)
print ret