ZOJ3278 8G Island

 #include <iostream>

#include<algorithm>

#include<string>

#include<memory.h>

using namespace std;

//此题似乎假定了魅力值是按1递增的

int n,m;

int b[100001];

int g[100001];

long long k;

long long le,ri;

int mid;

long long omid;

long long ans;

long long sum;

bool mycmp(int x,int y)

{

return x>y;

}

void inner(long long val)

{

int i,l,r;

    sum=0;

for(i=1;i<=n;i++){

l=1;

r=m;

int u=0;

while(l<=r){

mid=(l+r)/2;

if((long long )b[i]*g[mid]>=val){

u=mid;

l=mid+1;

}

else{

r=mid-1;

}

}

sum+=u;

}

}

void outer()

{

ans=le;

while(le<=ri){

omid=(le+ri)/2;

inner(omid);

if(sum>=k){

ans=omid;

le=omid+1;

}

else

ri=omid-1;

}

}

int main()

{

int i;

while(cin>>n>>m>>k){

memset(b,0,sizeof(b));

memset(g,0,sizeof(g));

for(i=1;i<=n;i++)

cin>>b[i];

for(i=1;i<=m;i++)

cin>>g[i];

//由高到低排序

sort(b+1,b+n+1,mycmp);

sort(g+1,g+m+1,mycmp);

ri=(long long)b[1]*g[1];

le=(long long)b[n]*g[m];

outer();

cout<<ans<<endl;

}

return 0;

}