Cod sursa(job #1484684)
Utilizator | Data | 11 septembrie 2015 17:25:10 | |
---|---|---|---|
Problema | Sortare prin comparare | Scor | 60 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.34 kb |
#include <fstream>
#include <map>
using namespace std;
ifstream f("algsort.in");
ofstream g("algsort.out");
map <int,int>M;
int n,m,i,j,x;
int main()
{
f>>n;
for(i=1;i<=n;++i) f>>x,M[x]++;
for(map<int,int>::iterator it=M.begin();it!=M.end();it++)
for(j=1,x=it->second;j<=x;++j) g<<it->first<<" ";
return 0;
}