立て看板 [Kyoto University Programming Contest 2018 A]

https://beta.atcoder.jp/contests/kupc2018/tasks/kupc2018_a

解法

https://beta.atcoder.jp/contests/kupc2018/submissions/3313658

実装問題。

int N, S[101], A[101];
//---------------------------------------------------------------------------------------------------
void _main() {
    cin >> N;
    rep(i, 0, N) cin >> S[i];
    rep(i, 0, N) cin >> A[i];
    int ans = 0;
    rep(i, 0, N) chmax(ans, S[i] * A[i]);
    cout << ans << endl;
}