题目详情
题目分析:
- 插入排序,可以用
multiset
实现 multiset
特点:可重复,插入自动排序,时间复杂度低
#include <set>
#include <cstdio>
using namespace std;
long n, b;
multiset<long> s;
int main()
{
scanf("%ld", &n);
for (int i = 0; i < n; i++)
{
scanf("%ld", &b);
s.insert(b);
}
multiset<long>::iterator iter = s.begin();
printf("%ld", *(iter++));
for (; iter != s.end(); iter++)
printf(" %ld", *iter);
}