贪心 sort

最新推荐文章于 2024-02-20 20:47:34 发布

Geek_sun

最新推荐文章于 2024-02-20 20:47:34 发布

阅读量216

点赞数

分类专栏： ACM 文章标签：贪心

本文链接：https://blog.csdn.net/Geek_sun/article/details/78715505

版权

ACM 专栏收录该内容

5 篇文章 0 订阅

订阅专栏

//Geeksun 2017.12.05

//博主第一次使用C++ 调试的时候sort()总是直接跳到库函数的页面，才疏学浅，望有高手能指点一二。

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?

Input

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).

Output

In the first line print the minimum number of essays.

Sample test(s)

input

output

input

2 5 4
5 2
5 2

output

Note

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.

题意：Vanya修了n门课，第i门课的学分是ai，已知每门课的最高学分不能超过r，而且他想得奖学金，但是获得奖学金的要求是：他的所有课的平均学分不得低于avg，如果不满足的话，他就不得不写论文去增加自己的学分，已知第i门课要增加1学分的话，必须写bi篇论文，由于，他比较懒，所以让你计算最少他需要写多少篇论文才能获得奖学金。

#include <stdio.h>
#include <algorithm>
using namespace std;

struct score
{
int a;
int b;
};

bool cmp(struct score x,struct score y);

struct score num[100005];
int main()
{
    long long n,r,avg,sum = 0;
    long long sum_poet = 0;
    int i;
    scanf("%I64d %I64d %I64d",&n,&r,&avg);
    for(i = 0; i < n; i++)
    {
        scanf("%d %d",&num[i].a,&num[i].b);
        sum += num[i].a;
    }
    sort(num,num + n,cmp);
    int flag = 0;
    i = 0;
    for(int i = 0;i < n&&sum < avg * n;i++)
    {
        flag = 1;
        long long int t = min(avg * n - sum,r - num[i].a);
        sum += t;
        sum_poet += t * num[i].b;
    }
    if(flag)
        printf("%I64d\n",sum_poet);
    else
        printf("0\n");
    return 0;
}

bool cmp(struct score x,struct score y)
{
return x.b < y.b;
}