Submission #3737396

---

Source Code Expand

/**
 *      purpose : ARC 13 B
 *      author  : kyomukyomupurin
 *      created : 2018-12-08 18:28:05
**/

#pragma GCC optimize ("Ofast")
#include <iostream>
#include <algorithm>
using namespace std;
using int64 = long long;
using pii = pair<int, int>;
#define rep(i, n) for (int i = 0; i < (int)(n); ++i)
#define all(v) (v).begin(), (v).end()
#define print(x) cout << (x) << '\n'
#define PB push_back
#define EB emplace_back
#define MP make_pair
#define fi first
#define se second

int main(){
    ios_base::sync_with_stdio(false);
    cin.tie(__null);
    
    int c; cin >> c;

    int x[c], y[c], z[c];

    rep(i, c) {
        int temp[3];
        cin >> temp[0] >> temp[1] >> temp[2];
        sort(temp, temp + 3);
        x[i] = temp[0]; y[i] = temp[1]; z[i] = temp[2];
    }

    print(*max_element(x, x + c) * *max_element(y, y + c) * *max_element(z, z + c));
    
    return 0;
}

Submission Info

Judge Result