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 func(vector<int> vect){
- int min1= INT_MAX, min2=min1;
- int max1= INT_MIN, max2= INT_MIN, max3= INT_MIN;
- for(int i=0; i<vect.size(); i++){
- if(vect[i] >= max1){
- max3= max2;
- max2= max1;
- max1= vect[i];
- }
- else if(vect[i] >= max2){
- max3= max2;
- max2= vect[i];
- }
- else if(vect[i] >= max3)
- max3= vect[i];
- if(vect[i] <= min1){
- min2= min1;
- min1= vect[i];
- }
- else if(vect[i] <= min2)
- min2= vect[i];
- }
- return max(max1*max2*max3, min1*min2*max1);
- }
- int main(){
- vector<int> vect= {1,3,4,-10,-10,10};
- cout<<func(vect);
- return 0;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement