Cod sursa(job #1046678)
Utilizator | Data | 3 decembrie 2013 12:32:41 | |
---|---|---|---|
Problema | Sortare prin comparare | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.32 kb |
#include <iostream>
#include <cstdio>
#include <algorithm>
FILE *f,*g;
using namespace std;
int main()
{f = fopen("algsort.in","r");
g = fopen("algsort.out","w");
int i,V[500000],N; fscanf(f,"%d\n",&N); for(i=0 ; i<N ; i++) fscanf(f,"%d ",&V[i]); sort(V,V+N); for(i=0 ; i<N ; i++) fprintf(g,"%d ",V[i]); return 0;}