Cod sursa(job #1455823)
Utilizator | Data | 29 iunie 2015 10:33:17 | |
---|---|---|---|
Problema | Sortare prin comparare | Scor | 60 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.37 kb |
#include<fstream>
#include<algorithm>
#include<set>
using namespace std;
multiset <int> s;
multiset <int> :: iterator it;
int n, x, i;
ifstream in("algsort.in");
ofstream out("algsort.out");
int main(){
in>>n;
for(i=1; i<=n; i++){
in>>x;
s.insert(x);
}
for(it=s.begin(); it!=s.end(); it++)
out<<*it<<" ";
return 0;
}