Submission #1131013

#	Time	Username	Problem	Language	Result	Execution time	Memory
1131013		julia_08	Kitchen (BOI19_kitchen)	C++20	0 / 100	1 ms	324 KiB

kitchen

#include <bits/stdc++.h>
using namespace std;

const int MAXN = 310;

int a[MAXN], aux[MAXN], b[MAXN];

int main(){
  cin.tie(0)->sync_with_stdio(0);

  int n, m, k; cin >> n >> m >> k;

  int s_a = 0;

  for(int i=0; i<n; i++){
    cin >> a[i];
    s_a += a[i];
  }

  for(int i=0; i<m; i++){
    cin >> b[i];
  }

  sort(b, b + m);

  for(int i=0; i<n; i++){
    if(a[i] < k){
      cout << "Impossible\n";
      return 0;
    }
  }

  int ans = 1e9;

  for(int mask=0; mask<(1 << m); mask++){
    // brutando o set

    for(int i=0; i<m; i++){
      if(mask & (1 << i)){
        aux[i] = b[i];

      } else aux[i] = 0;
    }

    sort(aux, aux + m);

    int s_b = 0;

    for(int i=0; i<m; i++){
      if(mask & (1 << i)){
        s_b += aux[i];
      }
    }

    if(s_a > s_b || k > __builtin_popcount(mask)) continue;

    bool ok = true;

    int last = 0;

    for(int i=0; i<n; i++){

      while(aux[last] == 0) last ++;

      if(m - last < k){
        ok = false;
        break;
      }

      for(int j=last; j<last + k; j++) aux[j] --;

    }

    if(ok) ans = min(ans, s_b - s_a);
  }

  if(ans == 1e9){
    cout << "Impossible\n";

  } else cout << ans << "\n";

  return 0;
}

• Subtask 1: 0 / 9
• Subtask 2: 0 / 22
• Subtask 3: 0 / 20
• Subtask 4: 0 / 21
• Subtask 5: 0 / 28