Cod sursa(job #1837333)
| Utilizator | Data | 29 decembrie 2016 15:28:33 | |
|---|---|---|---|
| Problema | Sortare prin comparare | Scor | 20 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.4 kb |
#include <iostream>
#include <fstream>
#include <set>
using namespace std;
ifstream f("algsort.in");
ofstream g("algsort.out");
int n;
int v[101];
multiset < int > s;
int main()
{
f >> n;
for ( int i = 1; i <= n ; i++ ) f >> v[i] , s.insert(v[i]) ;
multiset < int > ::iterator it;
for ( it = s.begin() ; it !=s.end() ; it++ )
g << *it << " " ;
return 0;
}
