AcWing 4818. 奶牛大学
原题链接
简单
作者:
火球大的脸盆
,
2023-01-08 21:32:32
,
所有人可见
,
阅读 139
排序 + 逆序枚举,Java 代码
import java.io.*;
import java.util.*;
public class Main {
static final int N = 100010;
static int[] q = new int[N], tmp = new int[N];
static int n;
static long totalres, feeres;
// 手写排序。
static void mergeSort(int[] q, int l, int r) {
if (l >= r) return;
int mid = l + r >> 1;
mergeSort(q, l, mid);
mergeSort(q, mid + 1, r);
int k = 0, i = l, j = mid + 1;
while (i <= mid && j <= r) {
if (q[i] <= q[j]) tmp[k++] = q[i++];
else tmp[k++] = q[j++];
}
while (i <= mid) tmp[k++] = q[i++];
while (j <= r) tmp[k++] = q[j++];
for (i = l, j = 0; i <= r; i++, j++) q[i] = tmp[j];
}
public static void main(String[] args) throws Exception {
BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
n = Integer.parseInt(br.readLine());
String[] in = br.readLine().split(" ");
for (int i = 0; i < n; i++) q[i] = Integer.parseInt(in[i]);
mergeSort(q, 0, n - 1);
// 从大到小枚举,便于输出学费最小的解。
for (int i = n - 1; i >= 0; i--) {
int num = n - i;
long total = (long)q[i] * num;
if (total >= totalres) {
totalres = total;
feeres = q[i];
}
}
// Java没有 %ld.
System.out.printf("%d %d\n", totalres, feeres);
}
}