在n个项目中寻找k个最小数字的算法。

I'm trying to write an algorithm which can print the k smallest numbers in an n-size-array in O(n) time, but I cannot reduce the time complexity to n. How can I do this?I'm trying to write an algorithm which can prin