Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <bits/stdc++.h>
- using namespace std;
- ifstream fin("alfa.in");
- ofstream fout("alfa.out");
- int n,x,v[1005],ind1,ind2;
- void partSort(int arr[],int a,int b)
- {
- for(int i=a;i<b;++i)
- for(int j=i+1;j<=b;++j)
- if(arr[i]>arr[j])
- swap(arr[i],arr[j]);
- }
- int main()
- {
- fin>>n>>x;
- fin>>v[1];
- ind1=1;
- for(int i=2;i<=n;++i)
- {
- fin>>v[i];
- if(v[i]==x)
- {
- ind2=i;
- if(ind2-ind1>1)
- partSort(v,ind1+1,ind2-1);
- ind1=ind2;
- }
- }
- for(int i=1;i<=n;++i)
- fout<<v[i]<<" ";
- return 0;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement