排序算法(从小到大排序)
1.较快(STL的sort)
#include<iostream>
#include<algorithm>
#include<vector>
#include<queue>
#include<iterator>
//1.STL的sort()解决问题
using namespace std;
int main(){
int n;
cin>>n;
vector<int>s;
int temp;
for(int i=0;i<n;i++){
cin>>temp;
s.push_back(temp);
}
sort(s.begin(),s.end());
copy(s.begin(),s.end(),ostream_iterator<int>(cout," "));
}
2.利用最小堆排序
int main(){
int n,k;
vector<int>a;
cin>>n;
for(int i=0;i<n;i++){
cin>>k;
a.push_back(k);
}
make_heap(a.begin(),a.end(),greater<int>());
for(int i=0;i<n;i++){
cout<<a.front()<<" ";
pop_he