Manthan, Codefest 18 B. Reach Median(思维)

#include <bits/stdc++.h>
#define maxn 200005
#define ll long long
using namespace std;
int n,m;
int pre[maxn];

int main()
{
  cin>>n>>m;
  ll ans = 0;
  for(int i=0;i<n;i++)cin>>pre[i];
  sort(pre, pre + n);
  for(int i=n/2+1;i<n;i++){
    if(m > pre[i]){
      ans += (m - pre[i]);
    }
  }
  for(int i=0;i<n/2;i++){
    if(m < pre[i]){
      ans += (pre[i] - m);
    }
  }
  cout<<ans + abs(pre[n/2] - m)<<endl;
  return 0;
}