0pts，悬棺求调。ALL WA

#include <iostream>
#include <algorithm>
#define int long long
using namespace std;
int a[1000000007];
int n;
int in(){
    int k=0,f=1;
    char c=getchar_unlocked();
    while(c<'0'||c>'9'){
        if(c=='-')f=-1;
        c=getchar_unlocked();
    }
    while(c>='0'&&c<='9')k=k*10+c-'0',c=getchar_unlocked();
    return k*f;
}
signed main(){
    int n;
    cin.tie(0);
    for(int i=1;i<=n;i++){
        a[i]=in();//这里用cin好像还是WA
    }
    sort(a+1,a+1+n);
    for(int i=1;i<=n;i++){
        printf("%lld ",a[i]);
    }
    putchar('\n');
    return 0;
}