acm算法 import java.util.Scanner;
public class 二分查找 {
二分查找(int N,int M,int[]a){
int min = 0, max = 0,mid,temp;
for(int i=0;i<N;i++){
if(min<a[i])
min=a[i];
max+=a[i];
}
mid=(min+max)/2;
temp=test(N,mid,a);
while(min<max){
if(temp==M){
max=mid-1;
}
else if(temp<M){
max=mid-1;
}else
min=mid+1;
mid=(max+min)/2;
temp=test(N,mid,a);
}
System.out.println(mid);
}
