code_1.cpp

//
//  q5.cpp
//  Algorithm
//
//  Created by Mohd Shoaib Rayeen on 05/11/18.
//  Copyright © 2018 Shoaib Rayeen. All rights reserved.
//

#include <bits/stdc++.h> 
using namespace std; 
  
int minProductSubset(int a[], int n) { 
    if (n == 1) {
        return a[0]; 
    }
    int max_neg = INT_MIN; 
    int min_pos = INT_MAX; 
    int count_neg = 0, count_zero = 0; 
    int prod = 1; 
    for (int i = 0; i < n; i++) { 
        if (a[i] == 0) { 
            count_zero++; 
            continue; 
        } 
        if (a[i] < 0) { 
            count_neg++; 
            max_neg = max(max_neg, a[i]); 
        } 
        if (a[i] > 0) {
            min_pos = min(min_pos, a[i]);         
        }
        prod = prod * a[i]; 
    } 
    if (count_zero == n || (count_neg == 0 && count_zero > 0)) {
        return 0; 
    }
    if (count_neg == 0) {
        return min_pos; 
    }
    if (!(count_neg & 1) && count_neg != 0) {  
        prod = prod / max_neg; 
    } 
    return prod; 
} 
  
int main()  { 
    int n;
    cout << "\nEnter Size\t:\t";
    cin >> n;
    int *a = new int[n];
    for ( int i  = 0; i < n; i++ ) {
       cin >> a[i];
    }
    cout << minProductSubset(a, n); 
    delete[] a;
    return 0; 
}