Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <iostream>
- int main()
- {
- int vag1{25};
- int vag2{5};
- int vag3{ 1 };
- int vag4{ 10 };
- int vag5{ 10 };
- int numElems{ 0 };
- //std::cin >> numElems;
- const int vagsSize{ 6 }; // compile time const
- const int sizeRT{ numElems }; // run time const
- int maxPassangers{ 100 };
- int minPassangers{ 0 };
- int vags[vagsSize];
- vags[0] = 25;
- vags[1] = 5;
- vags[2] = 2;
- vags[3] = 10;
- vags[4] = 11;
- vags[5] = 78;
- maxPassangers = vags[0];
- minPassangers = vags[0];
- for (int idx{ 0 }; idx < vagsSize; ++idx)
- {
- std::cout << vags[idx] << '\n';
- //maxPassangers = maxPassangers > vags[idx] ? maxPassangers : vags[idx];
- //minPassangers = minPassangers < vags[idx] ? minPassangers : vags[idx];
- if (vags[idx] > maxPassangers) { maxPassangers = vags[idx]; }
- if (vags[idx] < minPassangers) { minPassangers = vags[idx]; }
- }
- std::cout << "max passangers is: " << maxPassangers << '\n';
- std::cout << "min passangers is: " << minPassangers << '\n';
- /*std::cout << vags[idx++] << '\n';
- std::cout << vags[idx++] << '\n';
- std::cout << vags[idx++] << '\n';
- std::cout << vags[idx++] << '\n';
- std::cout << vags[idx++] << '\n';*/
- //
- //
- ////if (vag1 > vag2)
- ////{
- //// maxPassangers = vag1;
- ////}
- ////else
- ////{
- //// maxPassangers = vag2;
- ////}
- ////(vag1 > vag2) ? maxPassangers = vag1 : maxPassangers = vag2;
- ////maxPassangers = vag1 > vag2 ? vag1 > vag3 ? vag1 : vag3 : vag2 > vag3 ? vag2 : vag3;
- //maxPassangers = vag1 > vag2 ? vag1 : vag2;
- //maxPassangers = maxPassangers > vag3 ? maxPassangers : vag3;
- //maxPassangers = maxPassangers > vag4 ? maxPassangers : vag4;
- //maxPassangers = maxPassangers > vag5 ? maxPassangers : vag5;
- ////maxPassangers = vag1 > vag2 ? vag1 : vag2;
- ////minPassangers = vag1 < vag2 ? vag1 : vag2;
- //std::cout << "max passangers is: " << maxPassangers << '\n';
- ////std::cout << "min passangers is: " << minPassangers << '\n';
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement