Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <bits/stdc++.h>
- #define N 100001
- using namespace std;
- ifstream fin("cioc.in");
- ofstream fout("cioc.out");
- long long v[N],a[N];
- int n,k,kfinal,cer;
- void Citire()
- {
- fin>>cer>>n>>k;
- for(int i=1; i<=n; i++)
- {
- fin>>v[i];
- a[i]=v[i];
- }
- }
- void Afisare()
- {
- int i=k+1;
- kfinal=k;
- while(a[i]==a[i-1]&&i<=n)kfinal++,i++;
- if(cer==1) fout<<kfinal;
- else
- {
- int poz=kfinal+1;
- if(poz==n+1) a[poz]=a[n]+1;
- for(int i=1; i<=n; i++)
- {
- fout<<v[i]<<' ';
- if(v[i]<a[poz])fout<<v[i]*2<<" ";
- }
- }
- }
- int Pivot(int st, int dr)
- {
- int mij=(st+dr)/2;
- swap(a[st],a[mij]);
- int i=st, j=dr, d=0;
- while(i<j)
- {
- if(a[i]>a[j])
- {
- swap(a[i],a[j]);
- d=1-d;
- }
- i+=d;
- j-=1-d;
- }
- return i;
- }
- void QS(int st, int dr)
- {
- if(st<dr)
- {
- int mij=Pivot(st,dr);
- QS(st,mij-1);
- QS(mij+1,dr);
- }
- }
- int main()
- {
- Citire();
- //QS(1,n);
- sort(a+1,a+n+1);
- Afisare();
- return 0;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement