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

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.

                                                                            

计划好的考试月一天一道CFdiv.2的C题，前两天看一道不会一道，今儿终于做到了一道好水的C题，不知羞耻的来写题解。:)

思路：贪心的思想，将成绩的第二个数字按照从小到大排序。注意用long long。

#include <iostream>
#include <cstdio>
#include <algorithm>

using namespace std;
struct node{long long a, b;}exam[100005];

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

int main()
{
//freopen("in", "r", stdin);
    long long n, r, avg;
    while(~scanf("%I64d %I64d %I64d", &n, &r, &avg)) {
        long long sum = 0;
        for(int i = 0; i < n; ++i) {
            scanf("%I64d %I64d", &exam[i].a, &exam[i].b);
            sum += (long long)exam[i].a;
        }
        sort(exam, exam + n, cmp);
        long long ans = 0, cnt = (long long)avg*n - sum;
        int ok = 0;
        //printf("%d\n", cnt);
        if(cnt <= 0) {
            printf("0\n");
            continue;
        }
        for(int i = 0; i < n; ++i) {
            int c = r - exam[i].a;
            if(cnt - c < 0) {
                ans += cnt*exam[i].b;
                cnt = 0;
            }
            else {
                cnt -= c;
                ans += c*exam[i].b;
            }
            if(!cnt) break;
         }
         printf("%I64d\n", ans);
    }
    return 0;
}

CODE：