第 45 届国际大学生程序设计竞赛（ICPC）亚洲区域赛（济南）D-Fight against involution

最新推荐文章于 2022-12-04 11:50:22 发布

墨墨墨小白

最新推荐文章于 2022-12-04 11:50:22 发布

阅读量921

点赞数

分类专栏：题解

本文链接：https://blog.csdn.net/weixin_43537190/article/details/111874398

版权

题解专栏收录该内容

70 篇文章 1 订阅

订阅专栏

题目

MianKing chose a course in this semester. There are nn students in this course, and everyone needs to write a final paper. Let $w_i$ denote the word count of the i-th student’s final paper.The i-th student has a lower bound $L_i$ and an upper bound $R_i$
on the number of words in his final paper so that $L_i\leq w_i$ The grade rule of this course is very amazing. The grade of the i-th student $g_i$ is $n - K, K i$ is the number of $\in [1,n]$ satisfies that $w_j>w_i$ Every student wants to achieve the highest possible grade, so under the optimal decision $w_i$ will equal to $R_i$ for the i-th student.

But MianKing found an interesting thing: let’s assume that $\forall i \in [1,n]$ , $L_i=1000,R_i=10000∀i∈[1,n]$ Under the optimal decision $w_i$ are all equal to 10000 and the grades of the students are all nn. But if everyone only writes 1000 words in their final papers, their grades are still all nn and they can use the time they save to play games.

Now to fight against involution, MianKing wants to decide $w_i$ for each student, and his plan has to satisfy the following conditions:
For each student, his grade cannot be less than that in the original plan.
Minimize the sum of $w_i$
You need help MianKing calculate the minimum value of $\sum_{i=1}^{n}w_i$

The first line has one integer nn.

Then there are nn lines, the i-th line has two integers $L_i,R_i$

$1≤n≤10^5$

$1\leq L_i\leq R_i\leq 10^9$
在这里插入图片描述

题意

期末写论文，每个人写论文的字数在 $[L, R]$ 之间，每个人的得分是 $n - K$ , $K$ 是比当前这个人的作业字数多的人数，每个人都想写尽可能多的字，这个现象被称为“内卷”。为了对抗内卷，我们需要最小化 $W_i$ 的值。

思路

尽可能地让每个学生的 $W_i$ 值相同，考虑贪心，先按照 $R$ 从小到大排序，如果 $R$ 相同再按照 $L$ 从大到小排序，这样就可以保证上一次选择的最大的 $L$ 尽可能多的在下面的区间内，这样我们就能选择最多的相同的 $W_i$ 使得每个学生的得分最平均且最节省时间。

代码

#include <bits/stdc++.h>
using namespace std;

typedef long long ll;

const int maxn = 1e5+100;

class Stu 
{
	public:
		ll l,r;
}t[maxn];

bool cmp(Stu a,Stu b)
{
	return a.r==b.r?a.l>b.l:a.r<b.r;
}
int main()
{
	int n;
	scanf("%d",&n);
	for(int i=1;i<=n;i++) scanf("%lld%lld",&t[i].l,&t[i].r);
	sort(t+1,t+1+n,cmp);
	
	ll ans = 0,L = 0;
	for(int i=1;i<=n;i++)
	{
		ans += max(L,t[i].l);
		L = max(L,t[i].l);
	}
	cout<<ans;
}