제출 #423301

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
423301		abdzag	Kitchen (BOI19_kitchen)	C++17	31 / 100	302 ms	262148 KiB

kitchen

#include<bits/stdc++.h>
#include<unordered_map>
#define rep(i,a,b) for(int i=int(a);i<int(b);i++)
#define rrep(i,a,b) for(int i=int(a);i>int(b);i--)
#define trav(a,v) for(auto& a: v)
#define sz(v) v.size()
#define all(v) v.begin(),v.end()
#define vi vector<int>

typedef long long ll;
typedef long double ld;
typedef unsigned long long ull;
const long long inf = 1e15;

using namespace std;
int main() {
	cin.sync_with_stdio(false);
	ll n, m, k;
	cin >> n >> m >> k;
	vector<ll> v(n);
	vector<ll> v2(m);
	rep(i, 0, n) {
		cin >> v[i];
		if (v[i] < k) {
			cout << "Impossible" << endl;
			return 0;
		}
	}
	rep(i, 0, m)cin >> v2[i];
	ll sum = 0;
	rep(i, 0, n)sum += v[i];
	vector < pair < priority_queue<ll>,ll>> dp0;
	priority_queue<ll> definer;
	dp0.push_back(make_pair(definer, 0));
	vector < pair < priority_queue<ll>, ll>> dp=dp0;
	rep(i, 0, m) {
		trav(a, dp0) {
			dp.push_back(a);
			dp.back().first.push(-v2[i]);
			dp.back().second+=v2[i];
		}
		dp0 = dp;
	}
	ll ans = inf;
	trav(a, dp) {
		if (a.first.size() >= k) {
			ll cur = 0;
			while (1) {
				if (a.first.size() < k) {
					break;
				}
				cur += -a.first.top();
				a.first.pop();
				if (cur >= n)break;
			}
			if (a.second >= sum&&cur>=n) {
				ans = min(a.second, ans);
			}
		}
	}
	if (ans == inf)cout << "Impossible" << endl;
	else cout << ans - sum << endl;
	return 0;
}

컴파일 시 표준 에러 (stderr) 메시지

kitchen.cpp: In function 'int main()':
kitchen.cpp:46:22: warning: comparison of integer expressions of different signedness: 'std::priority_queue<long long int>::size_type' {aka 'long unsigned int'} and 'll' {aka 'long long int'} [-Wsign-compare]
   46 |   if (a.first.size() >= k) {
      |       ~~~~~~~~~~~~~~~^~~~
kitchen.cpp:49:24: warning: comparison of integer expressions of different signedness: 'std::priority_queue<long long int>::size_type' {aka 'long unsigned int'} and 'll' {aka 'long long int'} [-Wsign-compare]
   49 |     if (a.first.size() < k) {
      |         ~~~~~~~~~~~~~~~^~~

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