Cod sursa(job #784257)
| Utilizator | Data | 5 septembrie 2012 13:33:33 | |
|---|---|---|---|
| Problema | Sortare prin comparare | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.43 kb |
using namespace std;
#include<cstdio>
#include<algorithm>
#include<vector>
#define dmax 500001
typedef unsigned int nat;
int main()
{
int n;
vector<nat>v(dmax);
FILE *f=fopen("algsort.in","r");
FILE *g=fopen("algsort.out","w");
fscanf(f,"%d",&n);
for(int i=1;i<=n;i++)
fscanf(f,"%u",&v[i]);
sort(v.begin()+1,v.begin()+1+n);
for(int i=1;i<=n;i++)
fprintf(g,"%u ",v[i]);
fclose(f);
fclose(g);
return 0;
}
