P1177 【模板】排序题解

P1177 【模板】排序

题目描述

将读入的 $N$ 个数从小到大排序后输出。

输入格式

第一行为一个正整数 $N$。

第二行包含 $N$ 个空格隔开的正整数 $a_i$，为你需要进行排序的数。

输出格式

将给定的 $N$ 个数从小到大输出，数之间空格隔开，行末换行且无空格。

输入输出样例 #1

输入 #1

5
4 2 4 5 1

输出 #1

1 2 4 4 5

说明/提示

对于 $20\%$ 的数据，有 $1\le N\le 10^3$；

对于 $100\%$ 的数据，有 $1\le N\le 10^5$，$1\le a_i\le 10^9$。

思路

直接打暴力即可。

代码见下

#include<bits/stdc++.h> 
using namespace std;
long long n,m,a[100005],b[500005],b2[100005],b3[100005],f[2050][10005],db=0,cdb=0,db2=0,db3=0,op=1e18+7;
double dw=0;
int main(){
	cin>>n;
	for(int i=1;i<=n;i++){
		cin>>b[i];
	}
	sort(b+1,b+n+1);
    sort(b+1,b+n+1);
    sort(b+1,b+n+1);
    sort(b+1,b+n+1);
    sort(b+1,b+n+1);
    sort(b+1,b+n+1);
    sort(b+1,b+n+1);
    sort(b+1,b+n+1);
    sort(b+1,b+n+1);
    sort(b+1,b+n+1);
    sort(b+1,b+n+1);
    sort(b+1,b+n+1);
    sort(b+1,b+n+1);
    sort(b+1,b+n+1);
    sort(b+1,b+n+1);
    sort(b+1,b+n+1);
	sort(b+1,b+n+1);
    sort(b+1,b+n+1);
    sort(b+1,b+n+1);
    sort(b+1,b+n+1);
    sort(b+1,b+n+1);
    sort(b+1,b+n+1);
    sort(b+1,b+n+1);
    sort(b+1,b+n+1);
    sort(b+1,b+n+1);
    sort(b+1,b+n+1);
    sort(b+1,b+n+1);
    sort(b+1,b+n+1);
    sort(b+1,b+n+1);
    sort(b+1,b+n+1);
    sort(b+1,b+n+1);
    sort(b+1,b+n+1);    
	sort(b+1,b+n+1);
    sort(b+1,b+n+1);
    sort(b+1,b+n+1);
    sort(b+1,b+n+1);
    sort(b+1,b+n+1);
    sort(b+1,b+n+1);
    sort(b+1,b+n+1);
    sort(b+1,b+n+1);
    sort(b+1,b+n+1);
    sort(b+1,b+n+1);
    sort(b+1,b+n+1);
    sort(b+1,b+n+1);
    sort(b+1,b+n+1);
    sort(b+1,b+n+1);
    sort(b+1,b+n+1);
    sort(b+1,b+n+1);
	sort(b+1,b+n+1);
    sort(b+1,b+n+1);
    sort(b+1,b+n+1);
    sort(b+1,b+n+1);
    sort(b+1,b+n+1);
    sort(b+1,b+n+1);
    sort(b+1,b+n+1);
    sort(b+1,b+n+1);
    sort(b+1,b+n+1);
    sort(b+1,b+n+1);
    sort(b+1,b+n+1);
    sort(b+1,b+n+1);
    sort(b+1,b+n+1);
    sort(b+1,b+n+1);
    sort(b+1,b+n+1);
    sort(b+1,b+n+1);
	sort(b+1,b+n+1);
    sort(b+1,b+n+1);
    sort(b+1,b+n+1);
    sort(b+1,b+n+1);
    sort(b+1,b+n+1);
    sort(b+1,b+n+1);
    sort(b+1,b+n+1);
    sort(b+1,b+n+1);
    sort(b+1,b+n+1);
    sort(b+1,b+n+1);
    sort(b+1,b+n+1);
    sort(b+1,b+n+1);
    sort(b+1,b+n+1);
    sort(b+1,b+n+1);
    sort(b+1,b+n+1);
    sort(b+1,b+n+1);
	sort(b+1,b+n+1);
    sort(b+1,b+n+1);
    sort(b+1,b+n+1);
    sort(b+1,b+n+1);
    sort(b+1,b+n+1);
    sort(b+1,b+n+1);
    sort(b+1,b+n+1);
    sort(b+1,b+n+1);
    sort(b+1,b+n+1);
    sort(b+1,b+n+1);
    sort(b+1,b+n+1);
    sort(b+1,b+n+1);
    sort(b+1,b+n+1);
    sort(b+1,b+n+1);
    sort(b+1,b+n+1);
    sort(b+1,b+n+1);
	sort(b+1,b+n+1);
    sort(b+1,b+n+1);
    sort(b+1,b+n+1);
    sort(b+1,b+n+1);
    sort(b+1,b+n+1);
    sort(b+1,b+n+1);
    sort(b+1,b+n+1);
    sort(b+1,b+n+1);
    sort(b+1,b+n+1);
    sort(b+1,b+n+1);
    sort(b+1,b+n+1);
    sort(b+1,b+n+1);
    sort(b+1,b+n+1);
    sort(b+1,b+n+1);
    sort(b+1,b+n+1);
    sort(b+1,b+n+1);
	sort(b+1,b+n+1);
    sort(b+1,b+n+1);
    sort(b+1,b+n+1);
    sort(b+1,b+n+1);
    sort(b+1,b+n+1);
    sort(b+1,b+n+1);
    sort(b+1,b+n+1);
    sort(b+1,b+n+1);
    sort(b+1,b+n+1);
    sort(b+1,b+n+1);
    sort(b+1,b+n+1);
    sort(b+1,b+n+1);
    sort(b+1,b+n+1);
    sort(b+1,b+n+1);
    sort(b+1,b+n+1);
    sort(b+1,b+n+1);
	sort(b+1,b+n+1);
    sort(b+1,b+n+1);
    sort(b+1,b+n+1);
    sort(b+1,b+n+1);
    sort(b+1,b+n+1);
    sort(b+1,b+n+1);
    sort(b+1,b+n+1);
    sort(b+1,b+n+1);
    sort(b+1,b+n+1);
    sort(b+1,b+n+1);
    sort(b+1,b+n+1);
    sort(b+1,b+n+1);
    sort(b+1,b+n+1);
    sort(b+1,b+n+1);
    sort(b+1,b+n+1);
    sort(b+1,b+n+1);
	sort(b+1,b+n+1);
    sort(b+1,b+n+1);
    sort(b+1,b+n+1);
    sort(b+1,b+n+1);
    sort(b+1,b+n+1);
    sort(b+1,b+n+1);
    sort(b+1,b+n+1);
    sort(b+1,b+n+1);
    sort(b+1,b+n+1);
    sort(b+1,b+n+1);
    sort(b+1,b+n+1);
    sort(b+1,b+n+1);
    sort(b+1,b+n+1);
    sort(b+1,b+n+1);
    sort(b+1,b+n+1);
    sort(b+1,b+n+1);
	sort(b+1,b+n+1);
    sort(b+1,b+n+1);
    sort(b+1,b+n+1);
    sort(b+1,b+n+1);
    sort(b+1,b+n+1);
    sort(b+1,b+n+1);
    sort(b+1,b+n+1);
    sort(b+1,b+n+1);
    sort(b+1,b+n+1);
    sort(b+1,b+n+1);
    sort(b+1,b+n+1);
    sort(b+1,b+n+1);
    sort(b+1,b+n+1);
    sort(b+1,b+n+1);
    sort(b+1,b+n+1);
    sort(b+1,b+n+1);
	sort(b+1,b+n+1);
    sort(b+1,b+n+1);
    sort(b+1,b+n+1);
    sort(b+1,b+n+1);
    sort(b+1,b+n+1);
    sort(b+1,b+n+1);
    sort(b+1,b+n+1);
    sort(b+1,b+n+1);
    sort(b+1,b+n+1);
    sort(b+1,b+n+1);
    sort(b+1,b+n+1);
    sort(b+1,b+n+1);
    sort(b+1,b+n+1);
    sort(b+1,b+n+1);
    sort(b+1,b+n+1);
    sort(b+1,b+n+1);
	sort(b+1,b+n+1);
    sort(b+1,b+n+1);
    sort(b+1,b+n+1);
    sort(b+1,b+n+1);
    sort(b+1,b+n+1);
    sort(b+1,b+n+1);
    sort(b+1,b+n+1);
    sort(b+1,b+n+1);
    sort(b+1,b+n+1);
    sort(b+1,b+n+1);
    sort(b+1,b+n+1);
    sort(b+1,b+n+1);
    sort(b+1,b+n+1);
    sort(b+1,b+n+1);
    sort(b+1,b+n+1);
    sort(b+1,b+n+1);
	sort(b+1,b+n+1);
    sort(b+1,b+n+1);
    sort(b+1,b+n+1);
    sort(b+1,b+n+1);
    sort(b+1,b+n+1);
    sort(b+1,b+n+1);
    sort(b+1,b+n+1);
    sort(b+1,b+n+1);
    sort(b+1,b+n+1);
    sort(b+1,b+n+1);
    sort(b+1,b+n+1);
    sort(b+1,b+n+1);
    sort(b+1,b+n+1);
    sort(b+1,b+n+1);
    sort(b+1,b+n+1);
    sort(b+1,b+n+1);
	sort(b+1,b+n+1);
    sort(b+1,b+n+1);
    sort(b+1,b+n+1);
    sort(b+1,b+n+1);
    sort(b+1,b+n+1);
    sort(b+1,b+n+1);
    sort(b+1,b+n+1);
    sort(b+1,b+n+1);
    sort(b+1,b+n+1);
    sort(b+1,b+n+1);
    sort(b+1,b+n+1);
    sort(b+1,b+n+1);
    sort(b+1,b+n+1);
    sort(b+1,b+n+1);
    sort(b+1,b+n+1);
    sort(b+1,b+n+1);
	sort(b+1,b+n+1);
    sort(b+1,b+n+1);
    sort(b+1,b+n+1);
    sort(b+1,b+n+1);
    sort(b+1,b+n+1);
    sort(b+1,b+n+1);
    sort(b+1,b+n+1);
    sort(b+1,b+n+1);
    sort(b+1,b+n+1);
    sort(b+1,b+n+1);
    sort(b+1,b+n+1);
    sort(b+1,b+n+1);
    sort(b+1,b+n+1);
    sort(b+1,b+n+1);
    sort(b+1,b+n+1);
    sort(b+1,b+n+1);
	sort(b+1,b+n+1);
    sort(b+1,b+n+1);
    sort(b+1,b+n+1);
    sort(b+1,b+n+1);
    sort(b+1,b+n+1);
    sort(b+1,b+n+1);
    sort(b+1,b+n+1);
    sort(b+1,b+n+1);
    sort(b+1,b+n+1);
    sort(b+1,b+n+1);
    sort(b+1,b+n+1);
    sort(b+1,b+n+1);
    sort(b+1,b+n+1);
    sort(b+1,b+n+1);
    sort(b+1,b+n+1);
    sort(b+1,b+n+1);
	sort(b+1,b+n+1);
    sort(b+1,b+n+1);
    sort(b+1,b+n+1);
    sort(b+1,b+n+1);
    sort(b+1,b+n+1);
    sort(b+1,b+n+1);
    sort(b+1,b+n+1);
    sort(b+1,b+n+1);
    sort(b+1,b+n+1);
    sort(b+1,b+n+1);
    sort(b+1,b+n+1);
    sort(b+1,b+n+1);
    sort(b+1,b+n+1);
    sort(b+1,b+n+1);
    sort(b+1,b+n+1);
    sort(b+1,b+n+1);
	sort(b+1,b+n+1);
    sort(b+1,b+n+1);
    sort(b+1,b+n+1);
    sort(b+1,b+n+1);
    sort(b+1,b+n+1);
    sort(b+1,b+n+1);
    sort(b+1,b+n+1);
    sort(b+1,b+n+1);
    sort(b+1,b+n+1);
    sort(b+1,b+n+1);
    sort(b+1,b+n+1);
    sort(b+1,b+n+1);
    sort(b+1,b+n+1);
    sort(b+1,b+n+1);
    sort(b+1,b+n+1);
    sort(b+1,b+n+1);
	sort(b+1,b+n+1);
    sort(b+1,b+n+1);
    sort(b+1,b+n+1);
    sort(b+1,b+n+1);
    sort(b+1,b+n+1);
    sort(b+1,b+n+1);
    sort(b+1,b+n+1);
    sort(b+1,b+n+1);
    sort(b+1,b+n+1);
    sort(b+1,b+n+1);
    sort(b+1,b+n+1);
    sort(b+1,b+n+1);
    sort(b+1,b+n+1);
    sort(b+1,b+n+1);
    sort(b+1,b+n+1);
    sort(b+1,b+n+1);
	sort(b+1,b+n+1);
    sort(b+1,b+n+1);
    sort(b+1,b+n+1);
    sort(b+1,b+n+1);
    sort(b+1,b+n+1);
    sort(b+1,b+n+1);
    sort(b+1,b+n+1);
    sort(b+1,b+n+1);
    sort(b+1,b+n+1);
    sort(b+1,b+n+1);
    sort(b+1,b+n+1);
    sort(b+1,b+n+1);
    sort(b+1,b+n+1);
    sort(b+1,b+n+1);
    sort(b+1,b+n+1);
    sort(b+1,b+n+1);
	sort(b+1,b+n+1);
    sort(b+1,b+n+1);
    sort(b+1,b+n+1);
    sort(b+1,b+n+1);
    sort(b+1,b+n+1);
    sort(b+1,b+n+1);
    sort(b+1,b+n+1);
    sort(b+1,b+n+1);
    sort(b+1,b+n+1);
    sort(b+1,b+n+1);
    sort(b+1,b+n+1);
    sort(b+1,b+n+1);
    sort(b+1,b+n+1);
    sort(b+1,b+n+1);
    sort(b+1,b+n+1);
    sort(b+1,b+n+1);
	sort(b+1,b+n+1);
    sort(b+1,b+n+1);
    sort(b+1,b+n+1);
    sort(b+1,b+n+1);
    sort(b+1,b+n+1);
    sort(b+1,b+n+1);
    sort(b+1,b+n+1);
    sort(b+1,b+n+1);
    sort(b+1,b+n+1);
    sort(b+1,b+n+1);
    sort(b+1,b+n+1);
    sort(b+1,b+n+1);
    sort(b+1,b+n+1);
    sort(b+1,b+n+1);
    sort(b+1,b+n+1);
    sort(b+1,b+n+1);
	sort(b+1,b+n+1);
    sort(b+1,b+n+1);
    sort(b+1,b+n+1);
    sort(b+1,b+n+1);
    sort(b+1,b+n+1);
    sort(b+1,b+n+1);
    sort(b+1,b+n+1);
    sort(b+1,b+n+1);
    sort(b+1,b+n+1);
    sort(b+1,b+n+1);
    sort(b+1,b+n+1);
    sort(b+1,b+n+1);
    sort(b+1,b+n+1);
    sort(b+1,b+n+1);
    sort(b+1,b+n+1);
    sort(b+1,b+n+1);
	sort(b+1,b+n+1);
    sort(b+1,b+n+1);
    sort(b+1,b+n+1);
    sort(b+1,b+n+1);
    sort(b+1,b+n+1);
    sort(b+1,b+n+1);
    sort(b+1,b+n+1);
    sort(b+1,b+n+1);
    sort(b+1,b+n+1);
    sort(b+1,b+n+1);
    sort(b+1,b+n+1);
    sort(b+1,b+n+1);
    sort(b+1,b+n+1);
    sort(b+1,b+n+1);
    sort(b+1,b+n+1);
    sort(b+1,b+n+1);
	sort(b+1,b+n+1);
    sort(b+1,b+n+1);
    sort(b+1,b+n+1);
    sort(b+1,b+n+1);
    sort(b+1,b+n+1);
    sort(b+1,b+n+1);
    sort(b+1,b+n+1);
    sort(b+1,b+n+1);
    sort(b+1,b+n+1);
    sort(b+1,b+n+1);
    sort(b+1,b+n+1);
    sort(b+1,b+n+1);
    sort(b+1,b+n+1);
    sort(b+1,b+n+1);
    sort(b+1,b+n+1);
    sort(b+1,b+n+1);
	sort(b+1,b+n+1);
    sort(b+1,b+n+1);
    sort(b+1,b+n+1);
    sort(b+1,b+n+1);
    sort(b+1,b+n+1);
    sort(b+1,b+n+1);
    sort(b+1,b+n+1);
    sort(b+1,b+n+1);
    sort(b+1,b+n+1);
    sort(b+1,b+n+1);
    sort(b+1,b+n+1);
    sort(b+1,b+n+1);
    sort(b+1,b+n+1);
    sort(b+1,b+n+1);
    sort(b+1,b+n+1);
    sort(b+1,b+n+1);
	sort(b+1,b+n+1);
    sort(b+1,b+n+1);
    sort(b+1,b+n+1);
    sort(b+1,b+n+1);
    sort(b+1,b+n+1);
    sort(b+1,b+n+1);
    sort(b+1,b+n+1);
    sort(b+1,b+n+1);
    sort(b+1,b+n+1);
    sort(b+1,b+n+1);
    sort(b+1,b+n+1);
    sort(b+1,b+n+1);
    sort(b+1,b+n+1);
    sort(b+1,b+n+1);
    sort(b+1,b+n+1);
    sort(b+1,b+n+1);
	sort(b+1,b+n+1);
    sort(b+1,b+n+1);
    sort(b+1,b+n+1);
    sort(b+1,b+n+1);
    sort(b+1,b+n+1);
    sort(b+1,b+n+1);
    sort(b+1,b+n+1);
    sort(b+1,b+n+1);
    sort(b+1,b+n+1);
    sort(b+1,b+n+1);
    sort(b+1,b+n+1);
    sort(b+1,b+n+1);
    sort(b+1,b+n+1);
    sort(b+1,b+n+1);
    sort(b+1,b+n+1);
    sort(b+1,b+n+1);
	sort(b+1,b+n+1);
    sort(b+1,b+n+1);
    sort(b+1,b+n+1);
    sort(b+1,b+n+1);
    sort(b+1,b+n+1);
    sort(b+1,b+n+1);
    sort(b+1,b+n+1);
    sort(b+1,b+n+1);
    sort(b+1,b+n+1);
    sort(b+1,b+n+1);
    sort(b+1,b+n+1);
    sort(b+1,b+n+1);
    sort(b+1,b+n+1);
    sort(b+1,b+n+1);
    sort(b+1,b+n+1);
    sort(b+1,b+n+1);
    for(int i=1;i<=n;i++){
        cout<<b[i]<<" ";
    }
    cout<<endl;
	return 0;
}