剑指offer-最小的K个数（python）

# -*- coding:utf-8 -*-
class Solution:
    def GetLeastNumbers_Solution(self, tinput, k):
        # write code here
        if not tinput or k>len(tinput):
            return []
        a=sorted(tinput)
        return a[0:k]