C. Vanya and Exams
来源:互联网 发布:两组数据差值的标准差 编辑:程序博客网 时间:2024/05/18 06:09
Vanya wants to pass n exams and get the academic scholarship. He will get the scholarship if the average grade mark for all the exams is at least avg. The exam grade cannot exceed r. Vanya has passed the exams and got grade ai for the i-th exam. To increase the grade for the i-th exam by 1 point, Vanya must write bi essays. He can raise the exam grade multiple times.
What is the minimum number of essays that Vanya needs to write to get scholarship?
The first line contains three integers n, r, avg (1 ≤ n ≤ 105, 1 ≤ r ≤ 109, 1 ≤ avg ≤ min(r, 106)) — the number of exams, the maximum grade and the required grade point average, respectively.
Each of the following n lines contains space-separated integers ai and bi (1 ≤ ai ≤ r, 1 ≤ bi ≤ 106).
In the first line print the minimum number of essays.
5 5 45 24 73 13 22 5
4
2 5 45 25 2
0
In the first sample Vanya can write 2 essays for the 3rd exam to raise his grade by 2 points and 2 essays for the 4th exam to raise his grade by 1 point.
In the second sample, Vanya doesn't need to write any essays as his general point average already is above average.
解题说明:此题是一道模拟题,先对分数进行排序,然后从分数最少的开始往上加分,这样就能确保提升绩点所需要付出的努力最小。
#include<iostream>#include<cstdio>#include<algorithm>#include<cstring>#include<string>#include<cmath>#include<cstdlib>using namespace std;int main(){long long n,r,avr,s=0,x=0; cin>>n>>r>>avr;pair <long long, long long> a[100005];for(int i=0;i<n;i++){cin>>a[i].second>>a[i].first;s+=a[i].second;} x=n*avr-s; if (x<=0) { cout<<0; return 0; }sort(a,a+n);long long ans=0;for(int i=0;i<n;i++){long long kol=min(x, r-a[i].second);x-=kol;ans+=kol*a[i].first;if (x==0){break;}}cout<<ans<<endl;return 0;}
- C. Vanya and Exams
- 492C - Vanya and Exams
- Codeforces 492C Vanya and Exams(贪心)
- CodeForces 492C Vanya and Exams
- codeforce 492C. Vanya and Exams
- CF 280C. Vanya and Exams(div2)
- Codeforces-492C-Vanya and Exams
- Codeforces 492C Vanya and Exams【贪心】
- Vanya and Exams
- Codeforces Round #280 (Div. 2) C. Vanya and Exams
- CodeForces 492C Vanya and Exams(贪心)
- Codeforces Round #280 (Div. 2)---C. Vanya and Exams (贪心)
- Codeforces Round #280 (Div. 2)C. Vanya and Exams(贪心)
- Codeforces Round #280 (Div. 2)_C. Vanya and Exams
- C. Vanya and Examsv
- Codeforces #308 C. Vanya and Scales
- Codeforces 552C Vanya and Scales
- #308 (div.2) C. Vanya and Scales
- Convert Sorted List to Binary Search Tree
- Palindrome Partitioning II
- 关于图的邻接表定义的解释
- 云存储“T时代”:云空间推出1T免费空间
- Climbing Stairs
- C. Vanya and Exams
- 使用Nginx的proxy_cache缓存功能取代Squid[原创]
- PHP参数修改不生效的问题
- 如何判断$_POST传送的<textarea>标签中的值是否为空
- Reorder List
- Sudoku Solver
- Orace新建临时表空间、数据表空间、用户
- Word Ladder II
- Android Activity和Fragment的转场动画