fork download
  1. #include <iostream>
  2. #include <algorithm>
  3.  
  4. using namespace std;
  5.  
  6. class MangDong
  7. {
  8. private:
  9. int* arr;
  10. int n;
  11. public:
  12. MangDong();
  13. void nhap();
  14. void xuat();
  15. void sapXep();
  16. int soLonThuNhi();
  17. ~MangDong();
  18. };
  19.  
  20. MangDong::MangDong() : arr(nullptr), n(0) {};
  21.  
  22. void MangDong::nhap()
  23. {
  24. cout << "Nhap kich thuoc mang: ";
  25. cin >> n;
  26.  
  27. arr = new int[n];
  28.  
  29. for (int i = 0; i < n; ++i)
  30. {
  31. cout << "Nhap phan tu " << i + 1 << ": ";
  32. cin >> arr[i];
  33. }
  34. }
  35.  
  36. void MangDong::xuat()
  37. {
  38. cout << "Mang: ";
  39. for (int i = 0; i < n; ++i)
  40. cout << arr[i] << " ";
  41.  
  42. cout << endl;
  43. }
  44.  
  45. void MangDong::sapXep()
  46. {
  47. sort(arr, arr + n);
  48. }
  49.  
  50. int MangDong::soLonThuNhi()
  51. {
  52. if (n < 2)
  53. return cout << "Khong du kich thuoc\n", -1;
  54.  
  55. int max1 = arr[n - 1];
  56. int max2 = -1;
  57.  
  58. for (int i = n - 2; i >= 0; --i)
  59. {
  60. if (arr[i] < max1)
  61. {
  62. max2 = arr[i];
  63. break;
  64. }
  65. }
  66.  
  67. if (max2 == -1)
  68. cout << "Khong co so lon thu hai\n";
  69.  
  70. return max2;
  71. }
  72.  
  73. MangDong::~MangDong()
  74. {
  75. if (arr)
  76. {
  77. delete[] arr;
  78. arr = nullptr;
  79. }
  80. }
  81.  
  82. int main()
  83. {
  84. MangDong arr;
  85.  
  86. arr.nhap();
  87. arr.sapXep();
  88. arr.xuat();
  89. cout << arr.soLonThuNhi() << endl;
  90.  
  91. return 0;
  92. }
Success #stdin #stdout 0.01s 5284KB
stdin
Standard input is empty
stdout
Nhap kich thuoc mang: Mang: 
Khong du kich thuoc
-1