Cod sursa(job #799656)
| Utilizator | Data | 19 octombrie 2012 17:46:04 | |
|---|---|---|---|
| Problema | Sortare prin comparare | Scor | 60 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.36 kb |
#include<algorithm>
#include<stdio.h>
#include<set>
using namespace std;
int n,i,a;
int main()
{
multiset<int> M;
multiset<int>::iterator it;
freopen("algsort.in","r",stdin);
freopen("algsort.out","w",stdout);
scanf("%d",&n);
for(i=1;i<=n;i++){scanf("%d",&a);M.insert(a);}
for(it=M.begin();it!=M.end();it++)printf("%d ",*it);
return 0;
}
