Codeforces 808C Tea Party

最新推荐文章于 2018-08-17 01:04:15 发布

AndrewThompson

最新推荐文章于 2018-08-17 01:04:15 发布

阅读量440

点赞数

CC 4.0 BY-SA版权

分类专栏： Codeforces

本文链接：https://blog.youkuaiyun.com/zju2016/article/details/72566992

Codeforces 专栏收录该内容

32 篇文章

订阅专栏

本文介绍了一种容量分配算法，该算法通过比较容器的容量大小来决定如何分配资源。使用了C++实现，包括输入容器数量及容量，计算每只容器实际需要的容量，确保总体不超过指定限制。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

#include<iostream>
#include<vector>
#include<string>
#include<set>
#include<map>
#include<algorithm>
#include<queue>
#include<list>
#include<stack>
#include<cstdio>
#include<fstream>
#include<numeric>
#include<functional>
#include<utility>
#include<memory>
#include<iomanip>
using namespace std;

int n, k;

typedef struct node{
	int index;
	int capacity;
	int actual_size;
}node;

bool compare(node a, node b){
	return a.capacity > b.capacity;
}

int main(){
	while (cin >> n >> k){
		vector<node> cup;
		int sum = 0;
		for (int i = 0; i < n; i++){
			node m;
			cin >> m.capacity;
			m.index = i;
			cup.push_back(m);
			sum += m.capacity;
		}
		if (sum / 2 > k){
			cout << "-1" << endl;
		}
		else{
			bool flag = false;
			sort(cup.begin(), cup.end(), compare);
			for (int i = 0; i < cup.size(); i++){
				cup[i].actual_size = ceil(cup[i].capacity / (double)2);
				k -= cup[i].actual_size;
				if (k < 0){
					cout << "-1" << endl;
					flag = true;
					break;
				}
			}
			if (flag) continue;
			int i = 0;
			while (k){
				if (k >(cup[i].capacity - cup[i].actual_size)){
					k -= (cup[i].capacity - cup[i].actual_size);
					cup[i].actual_size = cup[i].capacity;
				}
				else{
					cup[i].actual_size += k;
					k = 0;
				}
				i++;
			}
			vector<int> res(n);
			for (int i = 0; i < cup.size(); i++){
				int index = cup[i].index;
				res[index] = cup[i].actual_size;
			}
			for (int i = 0; i < res.size(); i++){
				cout << res[i] << " ";
			}
			cout << endl;
		}
	}
	return 0;
}