Codeforces_729_C

http://codeforces.com/problemset/problem/729/C

二分找最小容量，然后找符合的最小花费。

#include<iostream>
#include<cstring>
#include<cstdio>
#include<algorithm>
using namespace std;

int n,k,s,t,c[],v[],g[];

bool f(int x)
{
    int tt = ;
    for(int i = ;i <= k+;i++)
    {
        int temp = g[i]-g[i-];
        if(x < temp)    return ;
        if(x >= temp*) tt += temp;
        else    tt += *temp-x;
    }
    if(tt > t)  return ;
    return ;
}
int main()
{
    scanf("%d%d%d%d",&n,&k,&s,&t);
    for(int i = ;i <= n;i++)   scanf("%d%d",&c[i],&v[i]);
    for(int i = ;i <= k;i++)   scanf("%d",&g[i]);
    sort(g+,g++k);
    g[k+] = s;
    g[] = ;
    int l = ,r = 1e9+;
    while(l < r)
    {
        int mid = (l+r)/;
        if(f(mid))  r = mid;
        else    l = mid+;
    }
    int ans = 1e9+;
    for(int i = ;i <= n;i++)
    {
        if(v[i] >= l)   ans = min(ans,c[i]);
    }
    if(ans == 1e9+)    printf("-1\n");
    else    printf("%d\n",ans);
    return ;
}