HDU1425: sort

Problem Description gives you n integers. Output The first m in the ascending order. There are two rows of test data in each Input group. The first row has two numbers n, m (0 <n, m <1000000), and the second row contains n different numbers, and all are integers in the range. Output outputs the first m of each group of test data in ascending order. Sample Input5 3 www.2cto. com3-35 92 213-644 Sample Output213 92 3 HintHint please use VC/VC ++ to submit // here the cin and cout cannot be used for input and output, [cpp] has timed out before # include <iostream> # include <cstdio> # include <algorithm> using namespace std; bool cmp (int x, int y) {return x> y;} int a [1000000]; int main () {int n, k; while (~ Scanf ("% d", & n, & k) {for (int I = 0; I <n; I ++) scanf ("% d ", & a [I]); sort (a, a + n, cmp); printf ("% d", a [0]); for (int I = 1; I <k; I ++) printf ("% d", a [I]); printf ("\ n");} return 0 ;}