Cod sursa(job #1481061)
| Utilizator | Data | 3 septembrie 2015 19:03:58 | |
|---|---|---|---|
| Problema | Sortare prin comparare | Scor | 20 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.61 kb |
#include <fstream>
using namespace std;
const int maxVal = 500000;
int main()
{
int N;
ifstream in("algsort.in");
ofstream out("algsort.out");
in >> N;
int V[maxVal + 1], a = 0;
for(int i = 0; i < maxVal + 1; i++)
{
V[i] = 0;
}
for(int i = 0; i < N; i++)
{
in >> a;
V[a]++;
}
for(int i = 0; i < maxVal + 1 ; i++)
{
for(int j = 0; j < V[i]; j++)
{
if(V[i] != 0)
{
out << i;
out << " ";
}
}
}
in.close();
out.close();
return 0;
}
