Codeforces 670C【排序+离散化】

最新推荐文章于 2021-04-19 20:44:27 发布

神探小小迪

最新推荐文章于 2021-04-19 20:44:27 发布

阅读量745

点赞数 5

分类专栏：数据结构----排序算法竞赛进阶指南数据结构文章标签：排序离散化

本文链接：https://blog.csdn.net/qq_37867156/article/details/81910111

版权

在一场国际会议上，科学家们需要选择一部电影，使得尽可能多的科学家满意。电影有不同语言的音频和字幕，科学家们根据所知语言的匹配程度分为非常满意、几乎满意和不满意。输入包括科学家的语言知识和电影的音频、字幕语言，要求找到让最多科学家非常满意的电影，若有多解，则选择使几乎满意人数最多的电影。离散化技术用于将语言映射到有限集合，便于统计。通过排序和离散化，可以确定最佳电影选择。

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

题目链接：http://codeforces.com/problemset/problem/670/C

Moscow is hosting a major international conference, which is attended by nscientists from different countries. Each of the scientists knows exactly one language. For convenience, we enumerate all languages of the world with integers from 1 to 109.

In the evening after the conference, all n scientists decided to go to the cinema. There are m movies in the cinema they came to. Each of the movies is characterized by two distinct numbers — the index of audio language and the index of subtitles language. The scientist, who came to the movie, will be very pleased if he knows the audio language of the movie, will be almost satisfied if he knows the language of subtitles and will be not satisfied if he does not know neither one nor the other (note that the audio language and the subtitles language for each movie are