UVa-solutions/11292.cpp at master · amitpriyankar/UVa-solutions · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
#include <bits/stdc++.h>
using namespace std;
int n,m;
int knight[1000000];
bool check[1000000]={false};
int binary_ceil(int l, int r,int val)
{
    if(l>r)return -1;
    else{


    int mid=l+(r-l+1);
    if(l==r)return mid;
   else if(knight[mid]<val)l=mid+1;
    else r=mid;
    cout<<mid<<endl;
    }

}
int main()
{

    while(true)
    {
        cin>>n>>m;
        if(n==0 && m==0)return 0;
        int dragon[n];
        for(int i=0; i<n; i++)cin>>dragon[i];
        for(int i=0; i<m; i++)cin>>knight[i];
        sort(dragon,dragon+n);
        sort(knight,knight+m);
        if(n>m)
        {
            cout<<"Loowater is doomed!"<<endl;

        }
        else{

            int ans=0;
            for(int i=0; i<n; i++)
            {
                int temp=binary_ceil(0,m-1,dragon[i]);
                if(knight[temp]>=dragon[i]&&!check[temp])
                {
                    ans+=knight[temp];
                    check[temp]=true;
                }
                else if(knight[temp]>=dragon[i]&& check[temp])
                {
                    if(temp==m-1)
                    {
                        ans=-1;
                        break;
                    }
                    ans+=knight[temp+1];
                    check[temp+1]=true;
               }
               else if(knight[temp]<dragon[i])
               {
                   ans=-1;
                   break;
               }

            }
            if(ans>0)cout<<ans<<endl;
            else cout<<"Loowater is doomed!"<<endl;
        }
    }
}