CodeForces 350A TL（基础题）

A. TL

time limit per test:2 seconds

memory limit per test:256 megabytes

input:standard input

output:standard output

Valera wanted to prepare a Codesecrof round. He's already got one problem and he wants to set a time limit (TL) on it.

Valera has written n correct solutions. For each correct solution, he knows its running time (in seconds). Valera has also wrotem wrong solutions and for each wrong solution he knows its running time (in seconds).

Let's suppose that Valera will set v seconds TL in the problem. Then we can say that a solution passes the system testing if its running time is at mostv seconds. We can also say that a solution passes the system testing with some "extra" time if for its running time,a seconds, an inequality2a ≤ v holds.

As a result, Valera decided to set v seconds TL, that the following conditions are met:

1. v is a positive integer;
2. all correct solutions pass the system testing;
3. at least one correct solution passes the system testing with some "extra" time;
4. all wrong solutions do not pass the system testing;
5. value v is minimum among all TLs, for which points1,2, 3, 4 hold.

Help Valera and find the most suitable TL or else state that such TL doesn't exist.

Input

The first line contains two integers n,m (1 ≤ n, m ≤ 100). The second line containsn space-separated positive integers a₁, a₂, ..., a_n (1 ≤ a_i ≤ 100) — the running time of each of the n correct solutions in seconds. The third line containsm space-separated positive integersb₁, b₂, ..., b_m (1 ≤ b_i ≤ 100) — the running time of each of m wrong solutions in seconds.

Output

If there is a valid TL value, print it. Otherwise, print -1.

Sample test(s)

Input

3 6
4 5 2
8 9 6 10 7 11

Output

5

Input

3 1
3 4 5
6

Output

-1

题意：

对一些解决方案的时间做一下限制，条件如下：

1.正确方案全部能通过测试

2.错误方案全部不能通过测试

3.正确方案中至少有一个需要花费2倍的时间

寻找一个最小的限制时间，使这时间达到以上条件

思路：

找到正确方案中解决方案的最大时间和最小时间，与错误方案中的解决方案的最小时间，做一定的比较。

/*************************************************************************
	> File Name: D.cpp
	> Author: BSlin
	> Mail:  
	> Created Time: 2013年10月02日 星期三 12时35分26秒
 ************************************************************************/

#include <iostream>
#include <cstdio>
#include <cstring>
#include <string>
#include <cstdlib>
#include <cmath>
#include <algorithm>
#include <iterator>
#include <vector>
#include <map>
#include <set>
#include <stack>
#include <queue>
#define MP make_pair
#define INF (1<<30)
#define PI acos(-1.0)
#define esp 1e-8
const int dx[4]={0,0,0,0};
using namespace std;
#define read freopen("in.txt","r",stdin)
#define write freopen("out.txt","w",stdout)
#if defined (_WIN32) || defined (__WIN32) || defined (WIN32) || defined (__WIN32__)
#define LL __int64
#define LLS "%" "I" "6" "4" "d"
#else
#define LL long long
#define LLS "%" "l" "l" "d"
#endif



int main(int argc, char** argv) {
    //read;
    int n,m;
    int ax,ad,bx,x;
    while(scanf("%d%d",&n,&m) != EOF) {
        ax = 100;
        ad = 1;
        bx = 100;
        for(int i=0; i<n; i++) {
            scanf("%d",&x);
            if(ax > x) ax = x;
            if(ad < x) ad = x;
        }
        for(int i=0; i<m; i++) {
            scanf("%d",&x);
            if(bx > x) bx = x;
        }
        //printf("%d %d %d \n",ax,ad,bx);
        if(bx <= ad) {
            printf("-1\n");
            continue;
        } else {
            if(2 * ax >= bx) {
                printf("-1\n");
                continue;
            } else {
                ad = max(ad,ax*2);
                printf("%d\n",ad);
            }
        }
    }
    return 0;
}