Codeforces Round #280 (Div. 2) C. Vanya and Exams 贪心

C. Vanya and Exams

time limit per test

1 second

memory limit per test

256 megabytes

input

standard input

output

standard output

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 a_i for the i-th exam. To increase the grade for the i-th exam by 1 point, Vanya must write b_i 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 ≤ 10⁵, 1 ≤ r ≤ 10⁹, 1 ≤ avg ≤ min(r, 10⁶)) — the number of exams, the maximum grade and the required grade point average, respectively.

Each of the following n lines contains space-separated integers a_i and b_i (1 ≤ a_i ≤ r, 1 ≤ b_i ≤ 10⁶).

Output

In the first line print the minimum number of essays.

Sample test(s)

Input

5 5 4
5 2
4 7
3 1
3 2
2 5

Output

4

Input

2 5 4
5 2
5 2

Output

0

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.

//排序，排完之后再从最小的开始加就Ok
#include <cstdio>
#include <cmath>
#include <cstring>
#include <ctime>
#include <iostream>
#include <algorithm>
#include <set>
#include <vector>
#include <sstream>
#include <queue>
#include <typeinfo>
#include <fstream>
typedef long long ll;
using namespace std;
//freopen("D.in","r",stdin);
//freopen("D.out","w",stdout);
#define sspeed ios_base::sync_with_stdio(0);cin.tie(0)
struct point{
    int a;
    int b;
};
bool cmp(point k,point m)
{
    return k.b<m.b;
}
point num[100010];
int main()
{
    ll n,r,avg;
    cin>>n>>r>>avg;
    avg=n*avg;
    ll sum=0;
    for(int i=0;i<n;i++)
    {
        scanf("%d%d",&num[i].a,&num[i].b);
        sum+=num[i].a;
    }
    sort(num,num+n,cmp);
    int kmp=0;
    ll ans=0;
    if(sum<avg){
    while(1)
    {
        sum+=(r-num[kmp].a);
        ans+=(r-num[kmp].a)*num[kmp].b;
        kmp++;
        if(sum>=avg)
            break;
        //cout<<ans<<endl;
        //cout<<sum<<endl;
    }
        cout<<ans-(sum-avg)*num[kmp-1].b<<endl;
        return 0;
    }
    cout<<ans<<endl;
    return 0;
}