剑指 Offer 40. 最小的k个数

题目

代码

#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;

vector<int> getLeastNumbers(vector<int>& arr, int k) {
    
	vector<int> res;
	if(k == 0){
    
		return res;
	}
	sort(arr.begin(), arr.end());
	for(int i = 0; i < k; i++){
    
		res.push_back(arr[i]);
	}
	return res;
}

int main(){
    
	int n, k;
	cin>>n>>k;
	vector<int> arr(n);
	vector<int> res;
	for(int i = 0; i < n; i++){
    
		cin>>arr[i];
	}
	res = getLeastNumbers(arr, k);
	for(int j = 0; j < res.size(); j++){
    
		cout<<res[j]<<" ";
	}
    return 0;
}