/*
输入一个数组,输入n,k找出n个数的K小
很简单,先排个序就行
*/
#include <cstdio>
#include <iostream>
#include <algorithm>
using namespace std;
const int maxn = 200000+5;
int a[maxn];
int main(void){
int n,k;
scanf("%d%d",&n,&k);
for(int i = 0;i <n;i ++){
scanf("%d",&a[i]);
}
sort(a,a+n);
for(int i = 0;i < k;i ++){
if(i == k-1)
//printf("%d\n",a[i]);
cout<<a[i]<<endl;
else
cout<<a[i]<<",";
}
}
搜狐笔试题-n个数取最小的k个数
最新推荐文章于 2020-02-12 17:41:11 发布