아직 만들고 있는 페이지입니다.

이 페이지는 아직 만드는 중입니다. 보이는 내용은 바뀔 수 있습니다.

Moo University - Financial Aid

면접 대비

시간 제한1초메모리 제한1024 MB

요약
지원자마다 시험 점수와 필요한 장학금이 주어질 때, 예산 F 안에서 정확히 N마리를 뽑아 중간 점수가 최대가 되도록 한다.
난이도

보통10점 중 6점

유형
이분 탐색, 정렬, 그리디
정답자
아직 제출이 없습니다

문제

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.

입력

  • 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

출력

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

예제1

  1. 예제 1

    입력
    3 5 70
    30 25
    50 21
    20 20
    5 18
    35 30
    
    예상 출력
    35