Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include<bits/stdc++.h>
- using namespace std;
- long long int dra[300000],kn[300000];
- int main()
- {
- long long int n,m,i,j,k,a,b,c;
- while(cin>>n>>m)
- {
- if(n==0 || m==0)
- break;
- for(i=1;i<=n;i++)
- cin>>dra[i];
- for(i=1;i<=m;i++)
- cin>>kn[i];
- if(n>m)
- {
- cout<<"Loowater is doomed!"<<endl;
- continue;
- }
- sort(dra,dra+n);
- sort(kn,kn+m);
- long long int ans=0,flag=0;
- for(i=0;i<=n;i++)
- {
- a=upper_bound(kn,kn+m,dra[i])-kn;
- cout<<"bound "<<a<<endl;
- cout<<"dra of i "<<dra[i]<<endl;
- cout<<"kn of a "<<kn[a]<<endl;
- if(kn[a]>=dra[i])
- {
- ans+=kn[a];
- cout<<ans<<endl;
- }
- else
- {
- flag=1;
- break;
- }
- }
- if(flag==1)
- {
- cout<<"Loowater is doomed!"<<endl;
- }
- else
- cout<<ans<<endl;
- }
- return 0;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement