Cod sursa(job #459971)
| Utilizator | Data | 31 mai 2010 21:00:40 | |
|---|---|---|---|
| Problema | Sortare prin comparare | Scor | 60 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.51 kb |
//Varianta cu set
#include <cstdio>
#include <set>
using namespace std;
FILE *in; FILE *out;
multiset <long> a;
multiset <long>::iterator it;
long i,k,n,b[500010];
int main () {
in=fopen ("algsort.in","r"); out=fopen ("algsort.out","w");
fscanf (in,"%ld",&n);
for (i=0; i<n; i++) {
fscanf (in,"%ld",&k);
a.insert (k);
}
for (it=a.begin (); it!=a.end (); it++) fprintf (out,"%ld ",*it);
fprintf (out,"\n");
fclose (in); fclose (out);
return 0;
}
