| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 1366885 | ivaziva | Kitchen (BOI19_kitchen) | C++20 | 0 ms | 344 KiB |
#include <bits/stdc++.h>
using namespace std;
#define MAXN 305
#define int long long
int n,m,k;
int a[MAXN],b[MAXN];
int32_t main()
{
cin>>n>>m>>k;
for (int i=1;i<=n;i++) cin>>a[i];
for (int i=1;i<=m;i++) cin>>b[i];
if (k==1)
{
int suma=0;for (int i=1;i<=n;i++) suma+=a[i];
int sumb=0;for (int i=1;i<=m;i++) sumb+=b[i];
if (sumb<suma) {cout<<"Impossible"<<endl;return 0;}
cout<<suma-sumb<<endl;return 0;
}
return 0;
}
| # | Result | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Result | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Result | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Result | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Result | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
