Cod sursa(job #262873)
Utilizator | MciprianM MciprianM | Data | 19 februarie 2009 18:36:20 |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.38 kb |
#include<cstdio>
#include<algorithm>
using namespace std;
int n, a[500000];
inline int cmp(int a, int b){
return a<b;
}
int main(){
int i;
freopen("algsort.in","r",stdin);
scanf("%d", &n);
for(i=0;i<n;i++)
scanf("%d",&a[i]);
sort(a,a+n,cmp);
freopen("algsort.out","w",stdout);
for(i=0;i<n;i++)
printf("%d ",a[i]);
printf("\n");
return 0;
}