제출 #1130989

#제출 시각아이디문제언어결과실행 시간메모리
1130989julia_08Kitchen (BOI19_kitchen)C++20
0 / 100
0 ms328 KiB
#include <bits/stdc++.h>
using namespace std;

const int MAXN = 310;

int a[MAXN], b[MAXN];

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

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

  int s_a = 0, s_b = 0;

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

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

  if(s_a > s_b){
    cout << "Impossible\n";
    return 0;
  }

  sort(b + 1, b + m + 1);

  for(int i=m; i>=1; i--){
    if(s_b - b[i] >= s_a){
      s_b -= b[i];
    }
  }

  cout << s_b - s_a << "\n";

  return 0;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...