【复试练习】九度OJ

1、1202 排序

http://ac.jobdu.com/problem.php?pid=1202

#include<stdio.h>#include<algorithm>//引入math头文件using namespace std;int main(){int n;int buf[10000];while(scanf("%d",&n)!=EOF){for(int i=0;i<n;i++){scanf(" %d",&buf[i]);}sort(buf,buf+n);for(int i=0;i<n;i++){printf("%d ",buf[i]);}printf("\n");}return 0;}