ABC288B前n个字符串排序

#include <bits/stdc++.h>
using namespace std;
int n, m, i, j, k;
char s[15];
string a[105];
int main(){
    scanf("%*d%d", &n);
    for(i=1; i<=n; i++){
        scanf("%s", s);
        a[i] = s;
    }//只需要读入前n个字符串
    sort(a+1, a+n+1);
    for(i=1; i<=n; i++){
        cout << a[i] << "\n";
    }//排序后cout
    return 0;
}