51NOD-01018 排序

Posted 2020-09-20 ONION_CYC

【算法】排序

#include<cstdio>
#include<algorithm>
using namespace std;
int n,a[50010];
int main()
{
    scanf("%d",&n);
    for(int i=1;i<=n;i++)scanf("%d",&a[i]);
    sort(a+1,a+n+1);
    for(int i=1;i<=n;i++)printf("%d\n",a[i]);
    return 0;
}

View Code