| # |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
| 377707 |
2021-03-14T20:33:41 Z |
SavicS |
Kitchen (BOI19_kitchen) |
C++14 |
|
0 ms |
0 KB |
#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 = 100005;
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];
int main()
{
ios::sync_with_stdio(false);
cout.tie(nullptr);
cin.tie(nullptr);
cin >> n >> m >> k;
ff(i,0,n - 1)cin >> a[i];
ff(i,0,m - 1)cin >> b[i];
// if(k > m)return cout << "Impossible", 0;
// ff(i,0,n - 1){
// if(a[i] < k)return cout << "Impossible", 0;
// }
// int zbira = 0;
// ff(i,0,n - 1)zbira += a[i];
// int zbirb = 0;
// ff(i,0,m - 1)zbirb += b[i];
// if(zbira > zbirb)return cout << "Impossible", 0;
int rez = inf;
ff(mask,0,(1 << m) - 1){
int sum = 0;
ff(i,0,m - 1){
if((1 << i) & mask)sum += b[i];
}
if(sum >= zbira)rez = min(rez, sum - zbira);
}
cout << (rez == inf ? "Impossible" : rez) << endl;
return 0;
}
/**
// probati bojenje sahovski ili slicno
**/
Compilation message
kitchen.cpp: In function 'int main()':
kitchen.cpp:56:13: error: 'zbira' was not declared in this scope
56 | if(sum >= zbira)rez = min(rez, sum - zbira);
| ^~~~~
kitchen.cpp:59:22: error: operands to ?: have different types 'const char*' and 'int'
59 | cout << (rez == inf ? "Impossible" : rez) << endl;
| ~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~
