Submission #1990003

---

Source Code Expand

#include <cstdio>
#include <iostream>
#include <algorithm>
#include <string>
#include <cstring>
#include <vector>
#include <queue>
#include <set>
#include <map>
#include <cmath>
#include <iomanip>
#include <cassert>
#include <bitset>
using namespace std;

typedef pair<int, int> P;
#define rep(i, n) for (int i=0; i<(n); i++)
#define all(c) (c).begin(), (c).end()
#define uniq(c) c.erase(unique(all(c)), (c).end())
#define index(xs, x) (int)(lower_bound(all(xs), x) - xs.begin())
#define _1 first
#define _2 second
#define pb push_back
#define INF 1145141919
#define MOD 1000000007
const int MAX_S = 55*22222*2;
typedef bitset<MAX_S+1> B;
inline void chmin(int &x, int v) { if (x > v) x = v; }

int N, M, K;
B dp[56];
signed main() {
  ios::sync_with_stdio(false); cin.tie(0);
  cin >> N >> M >> K;
  K = min(min(N, M), K);
  dp[0].set(0);
  int sum = 0;
  rep(i, N) {
    int a;
    cin >> a;
    sum += a;
    for (int j=K; j>=0; j--) {
      if (j+1 <= K) dp[j+1] |= dp[j];
      dp[j] <<= a;
    }
  }
  if (K == 1) dp[0] = B();
  rep(i, M) {
    int b;
    cin >> b;
    sum += b;
    for (int j=1; j<=K; j++) {
      dp[j-1] |= dp[j]<<b;
    }
  }
  long long m = 0;
  rep(s, sum+1) if (dp[0].test(s)) m = max(m, 1LL*s*(sum-s));
  cout << m << "\n";
  return 0;
}

Submission Info

Judge Result