#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <bits/stdc++.h>
#define fi first
#define se second
#define pb push_back
#define sz(a) (int)a.size()
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
#define ff(i,a,b) for(int i=a;i<=b;i++)
#define fb(i,b,a) for(int i=b;i>=a;i--)
using namespace std;
using namespace __gnu_pbds;
typedef long long ll;
typedef pair<int,int> pii;
const int maxn = 305;
const int inf = 1e9 + 5;
template<typename T>
using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
// os.order_of_key(k) the number of elements in the os less than k
// *os.find_by_order(k) print the k-th smallest number in os(0-based)
int n, m, k;
int a[maxn];
int b[maxn];
const int N = maxn * maxn;
int dp[N];
int main()
{
ios::sync_with_stdio(false);
cout.tie(nullptr);
cin.tie(nullptr);
cin >> n >> m >> k;
ff(i,1,n)cin >> a[i];
ff(i,1,m)cin >> b[i];
int A = 0;
ff(i,1,n){
A += a[i];
if(a[i] < k)return cout << "Impossible", 0;
}
memset(dp, -inf, sizeof(dp));
dp[0] = 0;
ff(i,1,m){
fb(j,N,0){
if(j >= b[i])dp[j] = max(dp[j], dp[j - b[i]] + min(n, b[i]));
}
}
ff(i,A,N){
if(dp[i] >= n * k){
cout << i - A << endl;
return 0;
}
}
cout << "Impossible" << endl;
return 0;
}
/**
// probati bojenje sahovski ili slicno
**/
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
1 ms |
748 KB |
Output is correct |
| 2 |
Correct |
1 ms |
748 KB |
Output is correct |
| 3 |
Correct |
1 ms |
748 KB |
Output is correct |
| 4 |
Correct |
1 ms |
768 KB |
Output is correct |
| 5 |
Correct |
1 ms |
748 KB |
Output is correct |
| 6 |
Correct |
1 ms |
364 KB |
Output is correct |
| 7 |
Correct |
1 ms |
364 KB |
Output is correct |
| 8 |
Correct |
1 ms |
748 KB |
Output is correct |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
1 ms |
748 KB |
Output is correct |
| 2 |
Correct |
1 ms |
748 KB |
Output is correct |
| 3 |
Correct |
1 ms |
748 KB |
Output is correct |
| 4 |
Correct |
1 ms |
768 KB |
Output is correct |
| 5 |
Correct |
1 ms |
748 KB |
Output is correct |
| 6 |
Correct |
1 ms |
364 KB |
Output is correct |
| 7 |
Correct |
1 ms |
364 KB |
Output is correct |
| 8 |
Correct |
1 ms |
748 KB |
Output is correct |
| 9 |
Correct |
3 ms |
748 KB |
Output is correct |
| 10 |
Correct |
3 ms |
748 KB |
Output is correct |
| 11 |
Correct |
3 ms |
748 KB |
Output is correct |
| 12 |
Correct |
4 ms |
748 KB |
Output is correct |
| 13 |
Correct |
3 ms |
748 KB |
Output is correct |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
34 ms |
748 KB |
Output is correct |
| 2 |
Correct |
33 ms |
748 KB |
Output is correct |
| 3 |
Correct |
40 ms |
748 KB |
Output is correct |
| 4 |
Correct |
40 ms |
876 KB |
Output is correct |
| 5 |
Correct |
39 ms |
748 KB |
Output is correct |
| 6 |
Correct |
30 ms |
748 KB |
Output is correct |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
8 ms |
748 KB |
Output is correct |
| 2 |
Correct |
7 ms |
748 KB |
Output is correct |
| 3 |
Correct |
6 ms |
748 KB |
Output is correct |
| 4 |
Correct |
6 ms |
748 KB |
Output is correct |
| 5 |
Correct |
1 ms |
364 KB |
Output is correct |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
1 ms |
748 KB |
Output is correct |
| 2 |
Correct |
1 ms |
748 KB |
Output is correct |
| 3 |
Correct |
1 ms |
748 KB |
Output is correct |
| 4 |
Correct |
1 ms |
768 KB |
Output is correct |
| 5 |
Correct |
1 ms |
748 KB |
Output is correct |
| 6 |
Correct |
1 ms |
364 KB |
Output is correct |
| 7 |
Correct |
1 ms |
364 KB |
Output is correct |
| 8 |
Correct |
1 ms |
748 KB |
Output is correct |
| 9 |
Correct |
3 ms |
748 KB |
Output is correct |
| 10 |
Correct |
3 ms |
748 KB |
Output is correct |
| 11 |
Correct |
3 ms |
748 KB |
Output is correct |
| 12 |
Correct |
4 ms |
748 KB |
Output is correct |
| 13 |
Correct |
3 ms |
748 KB |
Output is correct |
| 14 |
Correct |
34 ms |
748 KB |
Output is correct |
| 15 |
Correct |
33 ms |
748 KB |
Output is correct |
| 16 |
Correct |
40 ms |
748 KB |
Output is correct |
| 17 |
Correct |
40 ms |
876 KB |
Output is correct |
| 18 |
Correct |
39 ms |
748 KB |
Output is correct |
| 19 |
Correct |
30 ms |
748 KB |
Output is correct |
| 20 |
Correct |
8 ms |
748 KB |
Output is correct |
| 21 |
Correct |
7 ms |
748 KB |
Output is correct |
| 22 |
Correct |
6 ms |
748 KB |
Output is correct |
| 23 |
Correct |
6 ms |
748 KB |
Output is correct |
| 24 |
Correct |
1 ms |
364 KB |
Output is correct |
| 25 |
Correct |
28 ms |
748 KB |
Output is correct |
| 26 |
Correct |
33 ms |
748 KB |
Output is correct |
| 27 |
Correct |
22 ms |
748 KB |
Output is correct |
| 28 |
Correct |
32 ms |
748 KB |
Output is correct |
| 29 |
Correct |
33 ms |
748 KB |
Output is correct |
| 30 |
Correct |
40 ms |
748 KB |
Output is correct |
