找出n个数里最小的k个数

#include<iostream>
#include<vector>
#include<algorithm>
#include<cstdio>

#pragma warning (disable: 4996)
using namespace std;

int main()
{
	vector<int> num;
	int k = 0;
	int temp;
	while (scanf("%d",&temp)==1)
	{
		num.push_back(temp);
	}
	k = num[num.size() - 1];
	num.pop_back();
	sort(num.begin(), num.end());
	for (int i = 0; i < k; i++)
	{
		cout << num[i] << " ";
	}

	return 0;
}