제출 #492438

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
492438		niloyroot	Kitchen (BOI19_kitchen)	C++14	0 / 100	0 ms	204 KiB

kitchen

#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vi = vector<ll>;
using pl = pair<ll,ll>;
#define pb push_back
#define form(m,it) for(auto it=m.begin(); it!=m.end(); it++)
#define forp(i,a,b) for(ll i=a; i<=b; i++)
#define forn(i,a,b) for(ll i=a; i>=b; i--)
#define newl '\n'
#define ff first
#define ss second
const ll mod = 1000000007;

void solve(){
    ll n,m,k; cin>>n>>m>>k;
    ll a[n+1];
    ll b[n+1];
    ll sum=0;
    forp(i,1,n){
        cin>>a[i];
        sum+=a[i];
    }
    forp(i,1,m){
        cin>>b[i];
    }

    ll ans=INT_MAX;
    ll temp,cnt;
    forp(i,0,(1<<m)-1){
        temp=0;
        cnt=0;
        forp(j,0,m-1){
            if(i&(1<<j)){
                temp+=a[j+1];
                cnt+=(min(n,a[j+1]));
            }
        }

        if(temp>=sum){
            if(cnt>=n*k){
                ans=min(ans,temp-sum);
            }
        }
    }
    if(ans==INT_MAX){
        cout<<"Impossible"<<newl;
    } else {
        cout<<ans<<newl;
    }
}

int main(){
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    int t=1; //cin>>t;
    while(t--)solve();
}

• Subtask 1: 0 / 9
• Subtask 2: 0 / 22
• Subtask 3: 0 / 20
• Subtask 4: 0 / 21
• Subtask 5: 0 / 28