CodeForces-729C-Road to Cinema（二分查找 贪心 排序）

C. Road to Cinema
time limit per test1 second
memory limit per test256 megabytes
inputstandard input
outputstandard output
Vasya is currently at a car rental service, and he wants to reach cinema. The film he has bought a ticket for starts in t minutes. There is a straight road of length s from the service to the cinema. Let’s introduce a coordinate system so that the car rental service is at the point 0, and the cinema is at the point s.

There are k 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 n cars in the rental service, i-th of them is characterized with two integers ci and vi — 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 vi. 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 1 kilometer in 2 minutes, and consumes 1 liter of fuel. In the accelerated mode a car covers 1 kilometer in 1 minutes, but consumes 2 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 t minutes. Assume that all cars are completely fueled initially.

Input
The first line contains four positive integers n, k, s and t (1 ≤ n ≤ 2·105, 1 ≤ k ≤ 2·105, 2 ≤ s ≤ 109, 1 ≤ t ≤ 2·109) — 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 n lines contains two positive integers ci and vi (1 ≤ ci, vi ≤ 109) — the price of the i-th car and its fuel tank capacity.

The next line contains k distinct integers g1, g2, …, gk (1 ≤ gi ≤ s - 1) — the positions of the gas stations on the road in arbitrary order.

Output
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 t minutes). If there is no appropriate car, print -1.

Examples
input
3 1 8 10
10 8
5 7
11 9
3
output
10
input
2 2 10 18
10 4
20 6
5 3
output
20
Note
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 10, and the capacity of its fuel tank is 8. Then Vasya can drive to the first gas station in the accelerated mode in 3 minutes, spending 6 liters of fuel. After that he can full the tank and cover 2 kilometers in the normal mode in 4 minutes, spending 2 liters of fuel. Finally, he drives in the accelerated mode covering the remaining 3 kilometers in 3 minutes and spending 6 liters of fuel.

题意：首先给出N，K，S，T分别代表汽车类型数量，加油站数量，路程全程，最大耗时。
接着N行，每行给出一种汽车的价格和邮箱容积，最后一行给出K个加油站的位置。
汽车每到一个加油站都可以瞬间加满油，汽车有两种行驶方式，高速：一公里一分钟一升油，低速：一公里两分钟一升油。可以在任意时间选择任意一种行驶方式。
在小于最大耗时的前提下，选择价格最小的汽车跑完全程。输出最小价格，如果找不到就输出-1.

思路：根据最大耗时可以二分查找出最小油量，根据最小油量去汽车类型中找到最小价格。
对于二分过程，设出x1和x2代表高低速所走的路程，解个二元一次方程组即可。这时要处理好边界情况，比如就算全程慢速油料也不够用或者全程高速也用不完油料。实现时我直接忽略掉了x1,x2的中间结果，直接累加的时间

坑点一：二分出的结果并不一定合法。需要设置标记变量记录二分过程中是否真的找到过合法的油量，只要找到过一次，就可以拿这个合法的油量去汽车类型中求最小价格，如果一次都找不到，那么二分出的答案本身就不合法，也没必要去汽车类型中找答案了，直接输出-1吧。

坑点二：给出的油站位置是乱序的，记得排个序，把起点和终点都当作一个油站会方便运算。

代码

#include<stdio.h>
#include<iostream>
#include<algorithm>
#include<string.h>
using namespace std;
const long long int maxn=200005;
const long long int INF=0x3f3f3f3f;
struct node
{
    long long int c;//价格
    long long int v;//邮箱容量
} num[maxn];
long long int path[maxn];//第i个油站的位置
long long int N,K,S,T;
bool flag;//初始化为true，只要有人能跑完全程就标记为false
bool Judge(long long int mid)//mid油量是否能在T时间内赶到目的地
{
    double t=0;
    for(int i=1; i<=K+1; i++)
    {
        long long int dis=path[i]-path[i-1];
        if(mid<dis)//慢速都跑不过去？
            return false;
        if(dis*2<=mid)//全程高速都能跑？
            t+=dis;
        else//高低搭配跑过去？
            t+=dis*3-mid;
        if(t>T)
            return false;
    }
    flag=true;
    return true;
}
int main()
{
    scanf("%I64d%I64d%I64d%I64d",&N,&K,&S,&T);
    for(int i=0; i<N; i++)
        scanf("%I64d%I64d",&num[i].c,&num[i].v);
    path[0]=0;
    for(int i=1; i<=K; i++)
        scanf("%I64d",&path[i]);
    path[K+1]=S;
    sort(path,path+K+2);
    long long int left=0;
    long long int right=S*2;
    flag=false;
    while(left<right)
    {
        long long int mid=(left+right)/2;
        if(Judge(mid)==true)
            right=mid;
        else
            left=mid+1;
    }
    if(flag==false)//如果没有合法的解
    {
        printf("-1\n");
        return 0;
    }
    long long int result=INF;
    for(int i=0; i<N; i++)
    {
        if(num[i].v>=left&&num[i].c<result)
            result=num[i].c;
    }
    if(result==INF)
        printf("-1\n");
    else
        printf("%I64d\n",result);
    return 0;
}