CF729C.Road to Cinema

普及/提高-

通过率:0%

AC君温馨提醒

该题目为【codeforces】题库的题目,您提交的代码将被提交至codeforces进行远程评测,并由ACGO抓取测评结果后进行展示。由于远程测评的测评机由其他平台提供,我们无法保证该服务的稳定性,若提交后无反应,请等待一段时间后再进行重试。

题目描述

Vasya is currently at a car rental service, and he wants to reach cinema. The film he has bought a ticket for starts in tt minutes. There is a straight road of length ss from the service to the cinema. Let's introduce a coordinate system so that the car rental service is at the point 00 , and the cinema is at the point ss .

There are kk gas stations along the road, and at each of them you can fill a car with any amount of fuel for free! Consider that this operation doesn't take any time, i.e. is carried out instantly.

There are nn cars in the rental service, ii -th of them is characterized with two integers cic_{i} and viv_{i} — the price of this car rent and the capacity of its fuel tank in liters. It's not allowed to fuel a car with more fuel than its tank capacity viv_{i} . All cars are completely fueled at the car rental service.

Each of the cars can be driven in one of two speed modes: normal or accelerated. In the normal mode a car covers 11 kilometer in 22 minutes, and consumes 11 liter of fuel. In the accelerated mode a car covers 11 kilometer in 11 minutes, but consumes 22 liters of fuel. The driving mode can be changed at any moment and any number of times.

Your task is to choose a car with minimum price such that Vasya can reach the cinema before the show starts, i.e. not later than in tt minutes. Assume that all cars are completely fueled initially.

输入格式

The first line contains four positive integers nn , kk , ss and tt ( 1<=n<=21051<=n<=2·10^{5} , 1<=k<=21051<=k<=2·10^{5} , 2<=s<=1092<=s<=10^{9} , 1<=t<=21091<=t<=2·10^{9} ) — the number of cars at the car rental service, the number of gas stations along the road, the length of the road and the time in which the film starts.

Each of the next nn lines contains two positive integers cic_{i} and viv_{i} ( 1<=ci,vi<=1091<=c_{i},v_{i}<=10^{9} ) — the price of the ii -th car and its fuel tank capacity.

The next line contains kk distinct integers g1,g2,...,gkg_{1},g_{2},...,g_{k} ( 1<=gi<=s11<=g_{i}<=s-1 ) — the positions of the gas stations on the road in arbitrary order.

输出格式

Print the minimum rent price of an appropriate car, i.e. such car that Vasya will be able to reach the cinema before the film starts (not later than in tt minutes). If there is no appropriate car, print -1.

输入输出样例

  • 输入#1

    3 1 8 10
    10 8
    5 7
    11 9
    3
    

    输出#1

    10
    
  • 输入#2

    2 2 10 18
    10 4
    20 6
    5 3
    

    输出#2

    20
    

说明/提示

In the first sample, Vasya can reach the cinema in time using the first or the third cars, but it would be cheaper to choose the first one. Its price is equal to 1010 , and the capacity of its fuel tank is 88 . Then Vasya can drive to the first gas station in the accelerated mode in 33 minutes, spending 66 liters of fuel. After that he can full the tank and cover 22 kilometers in the normal mode in 44 minutes, spending 22 liters of fuel. Finally, he drives in the accelerated mode covering the remaining 33 kilometers in 33 minutes and spending 66 liters of fuel.

首页