A Retribution! - 2019 ECNA（贪心+结构体排序）

最新推荐文章于 2021-08-12 17:23:54 发布

inorganicy

最新推荐文章于 2021-08-12 17:23:54 发布

阅读量314

点赞数

本文链接：https://blog.csdn.net/inorganicy/article/details/119025847

版权

该博客讨论了一个竞赛中，教练们决定通过贪心算法来为法官分配最近的焦油仓库和羽毛仓库，以最小化总距离。博客内容包括问题描述、输入输出格式、题意解释、解题思路和代码实现。

摘要由CSDN通过智能技术生成

链接：https://ac.nowcoder.com/acm/contest/18453/A 来源：牛客网

题目描述

The coaches in a certain regional are fed up with the judges. During the last contest over 90% of the teams failed to solve a single problem—in fact, even half the judges found the problems too hard to solve. So the coaches have decided to tar and feather the judges. They know the locations of all the judges as well as the locations of tar repositories and feather storehouses. They would like to assign one repository and one storehouse to each judge so as to minimize the total distances involved. But this is a hard problem and the coaches don’t have time to solve it (the judges are evil but not stupid—they have a sense of the unrest they’ve fomented and are getting ready to leave town). So instead they’ve decided to use a greedy solution. They’ll look for the smallest distance between any tar repository and any judge loca