hdu 2019 数列有序!

数列有序!Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 35985 Accepted Submission(s): 15419


Problem DescriptionInputOutputSample InputSample OutputAuthorSourceRecommend#include<stdio.h>#include<string.h>int main(){ int num[105],n,m,i,j,k,c; while(scanf("%d%d",&n,&m)&&(n!=0||m!=0)) { c=0;//只能移一次 for(i=1;i<=n;i++) { scanf("%d",&num[i]); if(num[i]>=m&&!c)//往前赋值 { for(j=0;j<i-1;j++) { num[j]=num[j+1]; } num[i-1]=m; c++; } } for(i=0,c=0;i<=n;i++) printf(c++?" %d":"%d",num[i]); puts(""); } return 0;}