Cod sursa(job #1956730)
Utilizator | Data | 6 aprilie 2017 23:33:59 | |
---|---|---|---|
Problema | Radix Sort | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.4 kb |
#include <fstream>
#include <algorithm>
using namespace std;
int a[100];
int n;
ifstream f("elevi.in");
ofstream g("elevi.out");
void citeste()
{ int i;
f>>n;
for(i=1;i<=n;i++)
f>>a[i];
}
void scrie()
{ int i;
for(i=1;i<=n;i++)
g<<a[i]<<'\n';
}
int main()
{
citeste();
sort(a+1,a+n+1);
///sort(a+1,a+n+1,less<int>());
scrie();
return 0;
}