Cod sursa(job #3003762)
| Utilizator | Data | 15 martie 2023 21:54:58 | |
|---|---|---|---|
| Problema | Sortare prin comparare | Scor | 20 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.53 kb |
#include <iostream>
#include <fstream>
using namespace std;
int main()
{
ifstream f1 ("algsort.in");
ofstream f2 ("algsort.out");
int n,i,maxim=-1;
f1>>n;
int v[n];
for (i=0; i<n; i++)
{
f1>>v[i];
if(maxim<v[i])
maxim=v[i];
}
int w[maxim+1]= {0};
for (i=0; i<n; i++)
w[v[i]]++;
for (i=0; i<maxim+1; i++)
while (w[i]!=0)
{
f2<<i<< " ";
w[i]--;
}
return 0;
}
