#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 = 300 * 300;
int dp[N + 5];
int main()
{
ios::sync_with_stdio(false);
cout.tie(nullptr);
cin.tie(nullptr);
cin >> n >> m >> K;
int zbirA = 0, zbirB = 0, mn = inf;
ff(i,1,n)cin >> A[i], zbirA += A[i], mn = min(mn, A[i]);
ff(i,1,m)cin >> B[i], zbirB += B[i];
if(zbirA > zbirB || mn < K)return cout << "Impossible", 0;
memset(dp, -inf, sizeof(dp));
dp[0] = 0;
ff(i,1,m){
int X = B[i];
fb(j,N,1){
if(j >= X)dp[j] = max(dp[j], dp[j - X] + min(X, n));
}
}
ff(j,zbirA,N){
if(dp[j] >= n * K)return cout << j - zbirA, 0;
}
cout << "Impossible" << endl;
return 0;
}
/**
// probati bojenje sahovski ili slicno
**/
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
1 ms |
588 KB |
Output is correct |
| 2 |
Correct |
1 ms |
588 KB |
Output is correct |
| 3 |
Correct |
1 ms |
588 KB |
Output is correct |
| 4 |
Correct |
1 ms |
588 KB |
Output is correct |
| 5 |
Correct |
1 ms |
588 KB |
Output is correct |
| 6 |
Correct |
1 ms |
332 KB |
Output is correct |
| 7 |
Correct |
1 ms |
204 KB |
Output is correct |
| 8 |
Correct |
1 ms |
204 KB |
Output is correct |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
1 ms |
588 KB |
Output is correct |
| 2 |
Correct |
1 ms |
588 KB |
Output is correct |
| 3 |
Correct |
1 ms |
588 KB |
Output is correct |
| 4 |
Correct |
1 ms |
588 KB |
Output is correct |
| 5 |
Correct |
1 ms |
588 KB |
Output is correct |
| 6 |
Correct |
1 ms |
332 KB |
Output is correct |
| 7 |
Correct |
1 ms |
204 KB |
Output is correct |
| 8 |
Correct |
1 ms |
204 KB |
Output is correct |
| 9 |
Correct |
3 ms |
588 KB |
Output is correct |
| 10 |
Correct |
3 ms |
588 KB |
Output is correct |
| 11 |
Correct |
3 ms |
620 KB |
Output is correct |
| 12 |
Correct |
3 ms |
588 KB |
Output is correct |
| 13 |
Correct |
3 ms |
588 KB |
Output is correct |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
34 ms |
588 KB |
Output is correct |
| 2 |
Correct |
30 ms |
588 KB |
Output is correct |
| 3 |
Correct |
39 ms |
588 KB |
Output is correct |
| 4 |
Correct |
40 ms |
588 KB |
Output is correct |
| 5 |
Correct |
1 ms |
332 KB |
Output is correct |
| 6 |
Correct |
33 ms |
708 KB |
Output is correct |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
6 ms |
588 KB |
Output is correct |
| 2 |
Correct |
6 ms |
676 KB |
Output is correct |
| 3 |
Correct |
6 ms |
588 KB |
Output is correct |
| 4 |
Correct |
6 ms |
676 KB |
Output is correct |
| 5 |
Correct |
1 ms |
204 KB |
Output is correct |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
1 ms |
588 KB |
Output is correct |
| 2 |
Correct |
1 ms |
588 KB |
Output is correct |
| 3 |
Correct |
1 ms |
588 KB |
Output is correct |
| 4 |
Correct |
1 ms |
588 KB |
Output is correct |
| 5 |
Correct |
1 ms |
588 KB |
Output is correct |
| 6 |
Correct |
1 ms |
332 KB |
Output is correct |
| 7 |
Correct |
1 ms |
204 KB |
Output is correct |
| 8 |
Correct |
1 ms |
204 KB |
Output is correct |
| 9 |
Correct |
3 ms |
588 KB |
Output is correct |
| 10 |
Correct |
3 ms |
588 KB |
Output is correct |
| 11 |
Correct |
3 ms |
620 KB |
Output is correct |
| 12 |
Correct |
3 ms |
588 KB |
Output is correct |
| 13 |
Correct |
3 ms |
588 KB |
Output is correct |
| 14 |
Correct |
34 ms |
588 KB |
Output is correct |
| 15 |
Correct |
30 ms |
588 KB |
Output is correct |
| 16 |
Correct |
39 ms |
588 KB |
Output is correct |
| 17 |
Correct |
40 ms |
588 KB |
Output is correct |
| 18 |
Correct |
1 ms |
332 KB |
Output is correct |
| 19 |
Correct |
33 ms |
708 KB |
Output is correct |
| 20 |
Correct |
6 ms |
588 KB |
Output is correct |
| 21 |
Correct |
6 ms |
676 KB |
Output is correct |
| 22 |
Correct |
6 ms |
588 KB |
Output is correct |
| 23 |
Correct |
6 ms |
676 KB |
Output is correct |
| 24 |
Correct |
1 ms |
204 KB |
Output is correct |
| 25 |
Correct |
28 ms |
588 KB |
Output is correct |
| 26 |
Correct |
32 ms |
588 KB |
Output is correct |
| 27 |
Correct |
21 ms |
672 KB |
Output is correct |
| 28 |
Correct |
33 ms |
672 KB |
Output is correct |
| 29 |
Correct |
33 ms |
588 KB |
Output is correct |
| 30 |
Correct |
38 ms |
680 KB |
Output is correct |
