A17 排序 中位数 距离和的最小值

视频链接：51 排序 中位数 距离和的最小值_哔哩哔哩_bilibili

CH0501 货仓选址

 

#include <iostream>
#include <cstring>
#include <algorithm>
using namespace std;

const int N=100100;
int n,a[N];

int main(){
  cin>>n;
  for(int i=0; i<n; i++) cin>>a[i];
  sort(a,a+n);
  
  int ans=0;
  for(int i=0; i<n; i++) ans+=abs(a[i]-a[n/2]);
  cout<<ans;
}

 

CF1486B Eastern Exhibition

Luogu CF1486B Eastern Exhibition

 

#include <iostream>
#include <cstring>
#include <algorithm>
using namespace std;

const int N=1010;
int n,a[N],b[N];

int main(){
  int t; cin>>t;
  while(t--){
    cin>>n;
    for(int i=0; i<n; i++) cin>>a[i]>>b[i];
    sort(a,a+n); sort(b,b+n);
    
    int x=a[n/2]-a[(n-1)/2]+1;
    int y=b[n/2]-b[(n-1)/2]+1;
    cout<<1LL*x*y<<'\n';
  }
  return 0;
}