数列有序!
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 105906 Accepted Submission(s): 44240
#include <stdlib.h>
void main()
{
int n,m;
int aa[1000];
int i;
int sign;
while(~scanf("%d %d",&n,&m))
{
sign = 0;
if(m==0&&n==0)
return;
for(i=0;i<n;i++)
{
scanf("%d",&aa[i]);
}
if(m<aa[0])
{
printf("%d ",m);
sign = 1;
}
for(i=0;i<n-1;i++)
{
printf("%d ",aa[i]);
if(m>=aa[i]&&m<=aa[i+1]&&sign==0)
{
printf("%d ",m);
sign = 1;
}
}
if(m>aa[n-1])
{
printf("%d ",aa[n-1]);
printf("%d",m);
}
else
printf("%d",aa[n-1]);
printf("\n");
}
}
答案:
#include <stdio.h>
#include <stdlib.h>
#include <algorithm>
using namespace std;
void main()
{
int n,m;
int aa[1000];
int i;
while(~scanf("%d %d",&n,&m))
{
if(m==0&&n==0)
return;
for(i=0;i<n;i++)
{
scanf("%d",&aa[i]);
}
aa[n] = m;
sort(aa,aa+n+1);
for (i=0;i<n;i++)
{
printf("%d ",aa[i]);
}
printf("%d\n",aa[n]);
}
}
//答案1
/*void main()
{
int n,m;
int aa[1000];
int i;
int sign;
while(~scanf("%d %d",&n,&m))
{
sign = 0;
if(m==0&&n==0)
return;
for(i=0;i<n;i++)
{
scanf("%d",&aa[i]);
}
if(m<aa[0])
{
printf("%d ",m);
sign = 1;
}
for(i=0;i<n-1;i++)
{
printf("%d ",aa[i]);
if(m>=aa[i]&&m<=aa[i+1]&&sign==0)
{
printf("%d ",m);
sign = 1;
}
}
if(m>aa[n-1])
{
printf("%d ",aa[n-1]);
printf("%d",m);
}
else
printf("%d",aa[n-1]);
printf("\n");
}
}*/