AcWing 104. 货仓选址
原题链接
简单
作者:
STU756
,
2021-01-21 21:50:59
,
所有人可见
,
阅读 308
Time:O(NlogN) Space:O(1)
//C++
#include <iostream>
#include <algorithm>
using namespace std;
int n, a[100010];
int main(){
cin >> n;
for(int i = 0; i <n; i ++) cin >> a[i];
sort(a, a+n);
int res = 0;
for(int i = 0; i < n; i++) res += abs(a[i] - a[n / 2]);
cout << res << endl;
return 0;
}
//Java
import java.util.Scanner;
import java.util.Arrays;
public class Main{
public static void main(String ... args) {
Scanner s = new Scanner(System.in);
int n = s.nextInt();
int[] a = new int[n];
for(int i = 0; i < n; i++) a[i] = s.nextInt();
Arrays.sort(a);
int res = 0;
for(int i = 0; i < n; i++) res+= (int)Math.abs(a[i] - a[n / 2]);
System.out.println(res);
}
}