Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <bits/stdc++.h>
- using namespace std;
- /*
- multiplying 3 numbers from an array to get highest product possible
- */
- int m1, m2, m3;
- bool comp(int a, int b){
- if(m1 && !m2)
- {
- if(a < m1 && b< m1)
- return (a <b);
- else if (a==m1 || b==m1)
- return false;
- }
- if(m1 && m2){
- if(a < m1 && a< m2 && b< m1 && b<m2){
- return (a<b);
- }
- else if(a==m1 || a== m2 || b==m1 || b==m2)
- return false;
- }
- }
- int main(){
- vector<int> vect= {2,3,6,9,12,15};
- m1=0, m2=0, m3=0;
- m1= *max_element(vect.begin(), vect.end());
- m2= *max_element(vect.begin(), vect.end(), comp);
- cout<<m2<<endl;
- m3= *max_element(vect.begin(), vect.end(), comp);
- cout<<m3*m1*m2<<endl;
- return 0;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement