POJ1064二分


n根线,现在要把这n根线切割成k根等长(设长为len)的线,问能切得的最长的len为多少,

import java.io.BufferedReader;
import java.io.InputStream;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.math.BigInteger;
import java.util.StringTokenizer;

public class Main {
	public static void main(String[] args){
		new POJ1064().solve()  ; 
	}
}

class POJ1064{
	
	InputReader in = new InputReader(System.in) ;
	PrintWriter out = new PrintWriter(System.out) ;
    final int N = 10008 ;
    double[] x = new double[N] ;
    int n , k ; 
    boolean judge(double l){
    	int cnt = 0 ;
    	for(int i = 0 ; i < n ; i++){
    		cnt += (int)(x[i] / l) ;
    	}
    	return cnt >= k ;
    }
    
	void solve(){
		n = in.nextInt() ;
		k = in.nextInt() ;
		double left = 0.0 , right = 0.0 , mid , res = -1 ; 
		for(int i = 0 ; i < n ; i++){
			x[i] = in.nextDouble() ;
		    right = Math.max(right , x[i]) ;
		}
		for(int i = 0 ; i < 100 ; i++){
		     mid = (left + right) / 2 ;
		     if(judge(mid)) res = left = mid ;
		     else right = mid ;
           		     
		}
		out.printf("%.2f" , Math.floor(res*100)/100) ;
		out.println();
		out.flush() ; 
	}
}


class InputReader {  
    public BufferedReader reader;  
    public StringTokenizer tokenizer;  
  
    public InputReader(InputStream stream) {  
        reader = new BufferedReader(new InputStreamReader(stream), 32768);  
        tokenizer = new StringTokenizer("");  
    }  
  
    private void eat(String s) {  
        tokenizer = new StringTokenizer(s);  
    }  
  
    public String nextLine() {  
        try {  
            return reader.readLine();  
        } catch (Exception e) {  
            return null;  
        }  
    }  
  
    public boolean hasNext() {  
        while (!tokenizer.hasMoreTokens()) {  
            String s = nextLine();  
            if (s == null)  
                return false;  
            eat(s);  
        }  
        return true;  
    }  
  
    public String next() {  
        hasNext();  
        return tokenizer.nextToken();  
    }  
  
    public int nextInt() {  
        return Integer.parseInt(next());  
    }  
  
    public long nextLong() {  
        return Long.parseLong(next());  
    }  
  
    public double nextDouble() {  
        return Double.parseDouble(next());  
    }  
  
    public BigInteger nextBigInteger() {  
        return new BigInteger(next());  
    }  
  
}  



  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论

“相关推荐”对你有帮助么?

  • 非常没帮助
  • 没帮助
  • 一般
  • 有帮助
  • 非常有帮助
提交
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值