Problem B. Problem Select （atoi()函数）

Problem B. Problem Select
Input file: standard input
Output file: standard output
Time limit: 1 second
Memory limit: 256 megabytes
HOJ is an online judge system for students in HIT to practice. As the administrator, you would always
setup contests by selecting problems from the problem set. Problem IDs are integers that can be phased
by url. For example, the corresponding problem ID of url http://acm.hit.edu.cn/problemset/1001
is 1001.
Now the task is, given n urls, print the smallest k problem IDs in increasing order.
Input
The first line of the input contains one integer T (1 ≤ T ≤ 10), indicating the number of test cases.
For each test case, the first line contains two integers, n (1 ≤ n ≤ 1000) and k (1 ≤ k ≤ n).
For the next n lines, each line contains a string indicating the problem’s url. The problem ID is guaranteed
to be in range [1, 10000] and unique in each case.
Output
Output T lines.
For each test case, you should output k numbers in a line, and there shouldn’t be any spaces at the end
of the line.
Example
standard input
2
3 2
http://acm.hit.edu.cn/problemset/1003
http://acm.hit.edu.cn/problemset/1002
http://acm.hit.edu.cn/problemset/1001
4 1
http://acm.hit.edu.cn/problemset/1001
http://acm.hit.edu.cn/problemset/2001
http://acm.hit.edu.cn/problemset/3001
http://acm.hit.edu.cn/problemset/501
standard output
1001 1002
501

#include <bits/stdc++.h>
using namespace std;

int main()
{
    int a[10010];
    char s[110];
    int t;
    scanf("%d",&t);
    while(t--)
    {
        int n,m;
        scanf("%d %d",&n,&m);
        getchar();
        for(int i=1;i<=n;i++)
        {
            scanf("%s",s);
            int x=atoi(s+33);
            a[i]=x;
        }
        sort(a+1,a+n+1);
        for(int i=1;i<m;i++)
         printf("%d ",a[i]);
         printf("%d\n",a[m]);;

    }
    return 0;
}