Cod sursa(job #1377611)
Utilizator | Data | 5 martie 2015 23:00:51 | |
---|---|---|---|
Problema | Sortare prin comparare | Scor | 40 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.46 kb |
#include <fstream>
using namespace std;
ifstream fin("algsort.in");
ofstream fout("algsort.out");
int main()
{
int v[500005];
int n;
fin>>n;
for(int i=0; i<n; i++)
fin>>v[i];
for(int i=0; i<n-1; i++)
for(int j=i+1; j<n; j++)
if(v[i]>v[j])
{
int t=v[i];
v[i]=v[j];
v[j]=t;
}
for(int i=0; i<n; i++)
fout<<v[i]<<" ";
return 0;
}