22 lines
490 B
C++
22 lines
490 B
C++
#include <vector>
|
|
#include <iostream>
|
|
#include <algorithm>
|
|
|
|
using namespace std;
|
|
|
|
int maxProduct (vector<int>numbers , int sub_size)
|
|
{
|
|
// Sort numbers
|
|
std::sort(numbers.begin(), numbers.end());
|
|
int result = 1;
|
|
// Loop over last sub_size elements
|
|
for(auto ptr = numbers.end()-1; ptr >= numbers.end() - sub_size; ptr--){
|
|
result *= *ptr;
|
|
}
|
|
return result;
|
|
}
|
|
|
|
int main(){
|
|
std::vector<int> numbers = {1,2,3,4,5};
|
|
std::cout << maxProduct(numbers, 3);
|
|
} |