AcWing 4665. 最少刷题数
原题链接
简单
作者:
玛卡巴卡_386
,
2024-03-31 14:01:41
,
所有人可见
,
阅读 5
java代码
import java.util.*;
import java.io.*;
public class Main {
public static void main(String[] args) {
Scanner in = new Scanner(System.in);
int n = in.nextInt();
int[] a = new int[n];
for (int i = 0; i < n; i++) {
a[i] = in.nextInt();
}
int[] b = Arrays.copyOf(a, a.length);
Arrays.sort(b);
int target = b[n / 2];
int l = 0, r = 0;
for (int i = 0; i < n; i++) {
if (a[i] < target) {
l++;
} else if (a[i] > target) {
r++;
}
}
if (l < r) {
target++;
}
for (int i = 0; i < n; i++) {
if (a[i] >= target) {
System.out.print(0 + " ");
} else {
System.out.print((target - a[i]) + (l==r?1:0) + " ");
}
}
System.out.println();
}
}