Cod sursa(job #332611)
Utilizator | Data | 18 iulie 2009 23:41:07 | |
---|---|---|---|
Problema | Sortare prin comparare | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.36 kb |
#include <iostream.h>
#include <fstream.h>
int main()
{
ifstream f("algsort.in");
ofstream g("algsort.out");
long int n,v[500000],i,j,x=0,b[500000];
f>>n;
for (i=0;i<n;i++)
f>>v[i];
f.close();
for(i=0;i<n;i++)
{
x=0;
for(j=0;j<n;j++)
if(v[i]>v[j]) x++;
b[x]=v[i];
}
for (i=0;i<n;i++)
g<<b[i]<<" ";
g.close();
return 0;
}