Cod sursa(job #271651)
| Utilizator |  Bogdan Vlad bugy |
Data | 5 martie 2009 19:12:47 |
|---|---|---|---|
| Problema | Sortare prin comparare | Scor | 0 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.35 kb |
#include<fstream.h>
int main()
{
ifstream f("algsort.in");
ofstream g("algsort.out");
int n,v[1000],i,man,j;
f>>n;
for (i=1;i<=n;i++)
f>>v[i];
for(i=1;i<=n;i++)
for(j=1;j<=n;j++)
if (v[i]>v[j])
{man=v[i];
v[i]=v[j];
v[j]=man;}
for(i=n;i>=1;i--)
if(i!=i+1)
g<<v[i];
g<<"\n";
f.close();
g.close();
return 0;
}