fork download
  1. #include<iostream>
  2. #include<vector>
  3. #include<algorithm>
  4. using namespace std;
  5. // Функція для сортування за спаданням
  6. bool descending(int i,int j){return i>j;}
  7. int main(){
  8. //1
  9. vector<int>myvector;
  10. //2
  11. for(int i=0;i<10;i++)myvector.push_back(i);
  12. cout<<"size"<<myvector.size()<<"\n";
  13. cout<<"capacity:"<<myvector.capacity()<<"\n";
  14. for(int i=0;i<7;i++){
  15. int n;
  16. cin>>n;
  17. myvector.push_back(n);}
  18. //3
  19. vector<int>::iterator it2;
  20. it2=myvector.begin();
  21. it2+=2;
  22. cout<<*it2;
  23. it2=myvector.end();
  24. cout<<*(it2-1);
  25. for(vector<int>::iterator it=myvector.begin();it!=myvector.end();++it)
  26. cout<<' '<<*it;
  27. cout<<endl;
  28. //4
  29. myvector.pop_back();
  30. for(vector<int>::iterator it=myvector.begin();it!=myvector.end();++it)
  31. cout<<' '<<*it;
  32. //5
  33. cout<<endl<<myvector.front()<<" "<<myvector.back()<<endl;
  34. //6
  35. vector<int>secondVector={100,200,300};
  36. myvector.insert(myvector.end(),secondVector.begin(),secondVector.end());
  37. sort(myvector.begin(),myvector.end(),descending);
  38. for(vector<int>::iterator it=myvector.begin();it!=myvector.end();++it)
  39. cout<<' '<<*it;
  40. //7
  41. cout<<endl;
  42. cout<<myvector.size()<<endl;
  43. //8
  44. bool comp=false;
  45. int x=3;
  46. for(vector<int>::iterator it=myvector.begin();it!=myvector.end();++it){
  47. if(*it==x){
  48. comp=true;
  49. break;}}
  50. cout<<comp<<endl;
  51. //9
  52. myvector.clear();
  53. cout<<myvector.size();
  54. /*
  55. cout<<"size"<<myvector.size()<<"\n";
  56. cout<<"capacity:"<<myvector.capacity()<<"\n";
  57. cout<<"max-size:"<<myvector.max_size()<<"\n";
  58. for(int i=0;i<7;i++){
  59. myvector.pop_back();
  60. cout<<"size"<<myvector.size()<<"\n";
  61. cout<<"capacity:"<<myvector.capacity()<<"\n";
  62. }
  63. */
  64. return 0;}
  65.  
Success #stdin #stdout 0.01s 5284KB
stdin
6 3
stdout
size10
capacity:16
23 0 1 2 3 4 5 6 7 8 9 6 3 3 3 3 3 3
 0 1 2 3 4 5 6 7 8 9 6 3 3 3 3 3
0 3
 300 200 100 9 8 7 6 6 5 4 3 3 3 3 3 3 2 1 0
19
1
0