Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <iostream>
- using namespace std;
- void swap(int &a, int &b)
- {
- int temp = a;
- a = b;
- b = temp;
- }
- void sort(int &max1, int &max2, int &max3)
- {
- if (max3 >= max1) swap(max3, max1);
- if (max2 >= max1) swap(max2, max1);
- if (max3 >= max2) swap(max3, max2);
- }
- void find3Max(int A[], int n)
- {
- if (n < 2) return;
- int max1 = A[0];
- int max2 = A[1];
- int max3 = A[2];
- sort(max1, max2, max3);
- for (int i = 3; i < n; i++)
- {
- if (A[i] > max3) max3 = A[i];
- sort(max1, max2, max3);
- }
- cout << max1 << " " << max2 << " " << max3 ;
- }
- int main()
- {
- int A[10] = {0, 1, 2, 6, 7, 3, 4, 8, 9, 10};
- find3Max(A, 10);
- return 0;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement