# | 제출 시각UTC-0 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
1135138 | Sofiatpc | Kitchen (BOI19_kitchen) | C++20 | 43 ms | 68680 KiB |
#include <bits/stdc++.h>
using namespace std;
const int MAXN = 305;
int a[MAXN], b[MAXN], dp[MAXN][MAXN*MAXN];
int main(){
ios_base::sync_with_stdio(0);
cin.tie(0); cout.tie(0);
int n,m,k; cin>>n>>m>>k;
int sa = 0;
for(int i = 1; i <= n; i++){
cin>>a[i];
sa += a[i];
}
int sb = 0;
for(int i = 1; i <= m; i++){
cin>>b[i];
sb += b[i];
}
for(int i = 1; i <= n; i++)
if(a[i] < k){
cout<<"Impossible\n";
return 0;
}
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |