数列有序!

 1 #include<bits/stdc++.h>
 2 #define LL long long
 3 using namespace std;
 4 int main()
 5 {
 6     int ans[110];
 7     int n,m;
 8     while(cin>>n>>m&&n+m)
 9     {
10         for(int i=1;i<=n;++i)
11             cin>>ans[i];
12         int l=lower_bound(ans+1,ans+n+1,m)-ans;
13         for(int i=n;i>=l;i--)
14         {
15             ans[i+1]=ans[i];
16         }
17         ans[l]=m;
18         cout<<ans[1];
19         for(int i=2;i<=n+1;++i)
20             cout<<" "<<ans[i];
21         cout<<endl;
22 
23     }
24 }