Codeforces Round #203 (Div. 2)A

WA了几次还。。。

#include<iostream>
#include<set>
#include<map>
#include<vector>
#include<queue>
#include<cmath>
#include<climits>
#include<cstdio>
#include<string>
#include<cstring>
#include<algorithm>
typedef long long LL;
using namespace std;
int n,m;
int righ[110],wrong[110],twice[110];
int main()
{
    //freopen("in.txt","r",stdin);
    while(cin>>n>>m)
    {
        for(int i=0;i<n;i++)
        {
            cin>>righ[i];
            twice[i]=2*righ[i];
        }
        for(int i=0;i<m;i++)
            cin>>wrong[i];
        sort(righ,righ+n);
        sort(twice,twice+n);
        sort(wrong,wrong+m);
        int ans=max(righ[n-1],twice[0]);
        if(ans>=wrong[0])
        {
            cout<<-1<<endl;
            continue;
        }
        cout<<ans<<endl;
    }
    return 0;
}