在一行中输出能够串成的绳子的最大长度。结果向下取整,即取为不超过最大长度的最近整数。
输入样例:
8
10 15 12 3 4 13 1 15
结尾无空行
输出样例:
14
结尾无空行
Java代码实现(AC):
=============
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.StreamTokenizer;
import java.util.Arrays;
public class Main {
public static void main(String[] args) throws IOException {
StreamTokenizer in = new StreamTokenizer(new BufferedReader(new InputStreamReader(System.in)));
in.nextToken();
int N = (int) in.nval;
double[] arr = new double[N];
for (int i = 0; i < N; i++) {
in.nextToken();
arr[i] = in.nval;
}
Arrays.sort(arr); // 排序,让最长的绳子在后面
double sum = 0;
for (int i = 0; i < N-1; i++) {