Advertisement
SelinD

v73

Mar 4th, 2019
78
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
text 0.61 KB | None | 0 0
  1. #include<iostream>
  2. #include<fstream>
  3. using namespace std;
  4. ifstream fin("sir.in.cpp");
  5. ofstream fout("sir.out");
  6. int cautare(int n,int x[50],int v)
  7. {
  8. int st=1,dr=n,mijl;
  9. while(st<=dr)
  10. {
  11. mijl=(st+dr)/2;
  12. if(x[mijl]==v) return mijl;
  13. else if(x[mijl]<v) st=mijl+1;
  14. else if(x[mijl]>v) dr=mijl-1;
  15. }
  16. return st;
  17. }
  18. int main()
  19. {
  20. int n=0,x,i,poz,v[100];
  21. while(fin>>x)
  22. {
  23. poz=cautare(n,v,x);
  24. for(i=n; i>=poz; i--) v[i+1]=v[i];
  25. v[poz]=x;
  26. n++;
  27. }
  28. for(i=1; i<=n; i++) cout<<v[i]<<" ";
  29. fin.close();
  30.  
  31. }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement