Moo University - Financial Aid

Moo University - Financial Aid

Time Limit: 1000MS Memory Limit: 30000K

Total Submissions: 6020 Accepted: 1792

Description

Bessie noted that although humans have many universities they can attend, cows have none. To remedy this problem, she and her fellow cows formed a new university called The University of Wisconsin-Farmside,”Moo U” for short.

Not wishing to admit dumber-than-average cows, the founders created an incredibly precise admission exam called the Cow Scholastic Aptitude Test (CSAT) that yields scores in the range 1..2,000,000,000.

Moo U is very expensive to attend; not all calves can afford it.In fact, most calves need some sort of financial aid (0 <= aid <=100,000). The government does not provide scholarships to calves,so all the money must come from the university’s limited fund (whose total money is F, 0 <= F <= 2,000,000,000).

Worse still, Moo U only has classrooms for an odd number N (1 <= N <= 19,999) of the C (N <= C <= 100,000) calves who have applied.Bessie wants to admit exactly N calves in order to maximize educational opportunity. She still wants the median CSAT score of the admitted calves to be as high as possible.

Recall that the median of a set of integers whose size is odd is the middle value when they are sorted. For example, the median of the set {3, 8, 9, 7, 5} is 7, as there are exactly two values above 7 and exactly two values below it.

Given the score and required financial aid for each calf that applies, the total number of calves to accept, and the total amount of money Bessie has for financial aid, determine the maximum median score Bessie can obtain by carefully admitting an optimal set of calves.

Input

* Line 1: Three space-separated integers N, C, and F

• Lines 2..C+1: Two space-separated integers per line. The first is the calf’s CSAT score; the second integer is the required amount of financial aid the calf needs

Output

* Line 1: A single integer, the maximum median score that Bessie can achieve. If there is insufficient money to admit N calves,output -1.

Sample Input

3 5 70

30 25

50 21

20 20

5 18

35 30

Sample Output

35

Hint

Sample output:If Bessie accepts the calves with CSAT scores of 5, 35, and 50, the median is 35. The total financial aid required is 18 + 30 + 21 = 69 <= 70.

Source

USACO 2004 March Green

排序+最大堆维护,然后进行左右DP求出(1,i)和(i,c)之间收(n)/2个人的最小花费,然后遍历求出最大值

    #include <iostream>
    #include <cstdio>
    #include <cstring>
    #include <cmath>
    #include <queue>
    #include <algorithm>
    #define LL long long
    using namespace std;
    const int MAX =  101000;
    struct node
    {
        int sorce;
        int speed;
    }a[MAX];
    int n,c,f;
    int DpL[MAX];
    int DpR[MAX];
    priority_queue<int >Q;
    bool cmp(node b,node c)
    {
        if(b.sorce>c.sorce||(b.sorce==c.sorce&&b.speed<c.speed))
        {
            return true;
        }
        return false;
    }
    int main()
    {
        int m;
        long long sum;
        while(~scanf("%d %d %d",&n,&c,&f))
        {
            m=n/2;
            for(int i=1;i<=c;i++)
            {
                scanf("%d %d",&a[i].sorce,&a[i].speed);
            }
            sort(a+1,a+c+1,cmp);
            while(!Q.empty())
            {
                Q.pop();
            }
            sum=0;
            for(int i=1;i<=m;i++)
            {
                Q.push(a[i].speed);
                sum+=a[i].speed;
            }
            DpL[m]=sum;
            for(int i=m+1;i<=c-m;i++)
            {
                if(a[i].speed>=Q.top())
                {
                    DpL[i]=sum;
                }
                else
                {
                    sum=sum-Q.top()+a[i].speed;
                    DpL[i]=sum;
                    Q.pop();
                    Q.push(a[i].speed);
                }
            }
            while(!Q.empty())
            {
                Q.pop();
            }
            sum=0;
            for(int i=c;i>c-m;i--)
            {
                Q.push(a[i].speed);
                sum+=a[i].speed;
            }
            DpR[c-m+1]=sum;
            for(int i=c-m;i>=1;i--)
            {
                if(a[i].speed>=Q.top())
                {
                    DpR[i]=sum;
                }
                else
                {
                    sum=sum-Q.top()+a[i].speed;
                    DpR[i]=sum;
                    Q.pop();
                    Q.push(a[i].speed);
                }
            }
            int ans=-1;
            for(int i=m+1;i<=c-m;i++)
            {
                if(DpL[i-1]+a[i].speed+DpR[i+1]<=f)
                {
                    ans=a[i].sorce;
                    break;
                }
            }
            printf("%d\n",ans);
        }
        return 0;
    }