B. Maximum Product（枚举）

题目传送门

Maximum Product

题目大意

给你n个数，从中取出五个数使得其乘积最大

思路

直接暴力枚举取的正数的个数，相应的获得负数的个数，乘积取最大即可

AC Code

#include<cstdio>
#include<algorithm>
#include<iostream>
#include<cstring>
using namespace std;
#define endl '\n'
#define INF 0x3f3f3f3f3f3f
#define int long long
// #define TDS_ACM_LOCAL
const int N=2e5 +9;
int n, z[N], f[N];
bool cmp(int x, int y){
    return x>y;
}
void solve(){
    cin>>n;

    for(int i=1; i<=n; i++){
        cin>>z[i];
        f[i]=z[i];
    }

    sort(z+1, z+1+n);
    sort(f+1, f+1+n, cmp);
    int ans=-1e18;
    for(int i=0; i<=5; i++){
        int j=5-i;
        int tmp=1;
        for(int k=1; k<=i; k++) tmp*=z[k];
        for(int k=1; k<=j; k++) tmp*=f[k];
        ans=max(ans, tmp);
    }
    cout<<ans<<endl;
    return ;
}   

signed main(){
	ios::sync_with_stdio(0);
	cin.tie(0), cout.tie(0);
#ifdef TDS_ACM_LOCAL
    freopen("D:\\VS code\\.vscode\\testall\\in.txt", "r", stdin);
    freopen("D:\\VS code\\.vscode\\testall\\out.txt", "w", stdout);
#endif
    int T;
    cin>>T;
    while(T--)  solve();
    return 0;
}