text stringlengths 49 983k |
|---|
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
int n, s;
cin >> n >> s;
vector<int> a(n);
for (int i = 0; i < n; ++i) cin >> a[i];
sort(a.begin(), a.end());
ll res = a[n / 2] - s;
if (res < 0) res = -res;
for (int i = 0; i < n / 2; ++i) {
if (a[i] > s) res += a[i] - s;
}
for (int i = n / 2 + 1; i < n; ++i) {
if (a[i] < s) res += s - a[i];
}
cout << res << '\n';
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
long long a[200200];
int main() {
long long n, s;
cin >> n >> s;
for (long long i = 0; i < n; i++) cin >> a[i];
sort(a, a + n);
if (n == 1) {
cout << abs(s - a[0]) << endl;
return 0;
}
long long Ans = 0, i = n / 2;
if (s > a[n / 2]) {
while (a[i] < s && i < n) {
Ans += abs(s - a[i]);
i++;
}
} else {
while (a[i] > s && i >= 0) {
Ans += abs(s - a[i]);
i--;
}
}
cout << Ans << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, x;
cin >> n >> x;
vector<int> data(n);
for (int i = 0; i < n; ++i) {
cin >> data[i];
}
sort(data.begin(), data.end());
long long ans = 0;
int med = data[n / 2];
if (med > x) {
for (int i = n / 2; i >= 0; --i) {
if (data[i] > x) ans += data[i] - x;
}
} else {
for (int i = n / 2; i < n; ++i)
if (data[i] < x) ans += x - data[i];
}
cout << ans << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
long long a[3000000];
int main() {
long long int i, j, n, m, sum = 0;
cin >> n >> m;
j = (n + 1) / 2;
for (i = 1; i <= n; i++) cin >> a[i];
sort(a + 1, a + n + 1);
for (i = 1; i <= n; i++) {
sum += a[i];
if (i == j)
a[i] = m;
else if (i < (j)) {
if (a[i] > m) a[i] = m;
} else {
if (a[i] < m) a[i] = m;
}
}
for (i = 1; i <= n; i++) {
sum -= a[i];
}
cout << abs(sum) << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
long long int n, s, ans = 0, mid = 0;
scanf("%lld %lld", &n, &s);
long long int a[n];
for (int i = 0; i < n; i++) scanf("%lld", &a[i]);
sort(a, a + n);
mid = n / 2;
if (s >= a[mid]) {
for (int i = n / 2; i < n; i++) {
if (a[i] >= s)
break;
else
ans += abs(s - a[i]);
}
} else {
for (int i = n / 2; i >= 0; i--) {
if (a[i] <= s)
break;
else
ans += abs(a[i] - s);
}
}
cout << ans;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
long long a[n];
for (long long i = 0; i < n; i++) cin >> a[i];
sort(a, a + n);
long long ans = 0;
if (k > a[n / 2]) {
long long i = n / 2;
while (i < n && a[i] < k) {
ans += k - a[i];
i++;
}
} else {
long long i = n / 2;
while (i >= 0 && a[i] > k) {
ans += a[i] - k;
i--;
}
}
cout << ans;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = double;
using pii = pair<int, int>;
using vi = vector<int>;
const int maxn = 5e5;
const int inf = 1e9;
const int mod = 1e9 + 7;
const ll inf64 = 1e18;
const ld pi = acos(-1.0);
const ld eps = 1e-6;
int main() {
ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);
int n, s;
cin >> n >> s;
ll ans = 0;
vi a(n);
for (int i = 0; i < n; i++) cin >> a[i];
sort((a).begin(), (a).end());
for (int i = 0; i < n / 2; i++) ans += max(0, a[i] - s);
ans += abs(a[n / 2] - s);
for (int i = n / 2 + 1; i < n; i++) ans += max(0, s - a[i]);
cout << ans;
}
|
#include <bits/stdc++.h>
using namespace std;
const long long N = 1e6 + 69, base = 1024 * 1024, mod = 1e9 + 7;
vector<int> vek;
int32_t main(void) {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
int n, second;
long long wyn = 0;
cin >> n >> second;
for (int i = 0; i < n; i++) {
int a;
cin >> a;
vek.push_back(a);
}
sort(vek.begin(), vek.end());
if (vek[n / 2] > second) {
for (int i = n / 2; i >= 0 && vek[i] > second; i--)
wyn += abs(second - vek[i]);
}
if (vek[n / 2] < second) {
for (int i = n / 2; i < n && vek[i] < second; i++)
wyn += abs(second - vek[i]);
}
cout << wyn << "\n";
}
|
#include <bits/stdc++.h>
using namespace std;
const long long int mod = 1000000007;
const long long int mod2 = 4294967296;
const long long int pmod = 998244353;
int dx[] = {-1, 0, 1, 0};
int dy[] = {0, 1, 0, -1};
bool isPrime(long long int n) {
if (n <= 1) {
return false;
}
for (long long int i = 2; i < n; i++)
if (n % i == 0) return false;
return true;
}
int tests() {
long long int n, k;
cin >> n >> k;
long long int a[n];
for (long long int i = 0; i < n; ++i) {
cin >> a[i];
}
sort(a, a + n);
long long int mid = n / 2;
long long int ans = 0;
long long int ans2 = 0;
if (a[mid] == k) {
cout << 0 << "\n";
} else if (a[mid] < k) {
for (long long int i = mid; i < n; i++) {
if (a[i] < k) {
ans += abs(k - a[i]);
}
}
cout << ans << "\n";
} else {
for (long long int i = 0; i <= mid; i++) {
if (a[i] > k) {
ans += abs(a[i] - k);
}
}
cout << ans << "\n";
}
return 0;
}
int main() {
ios_base::sync_with_stdio(0);
cin.tie(NULL);
cout.tie(NULL);
;
long long int t = 1;
while (t--) {
tests();
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
long long n, k, mid, ans;
const int N = 200005;
long long a[N];
int main() {
scanf("%lld%lld", &n, &k);
for (int i = 1; i <= n; ++i) scanf("%lld", &a[i]);
sort(a + 1, a + 1 + n);
mid = (n + 1) / 2;
for (int i = 1; i <= mid; ++i) {
if (a[i] > k) ans += a[i] - k;
}
for (int i = mid; i <= n; ++i) {
if (a[i] < k) ans += k - a[i];
}
printf("%lld\n", ans);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int a[200000];
int main() {
int n, i, s;
long long num = 0;
scanf("%d %d", &n, &s);
for (i = 0; n > i; i++) {
scanf("%d", &a[i]);
}
sort(a, a + n);
if (a[n / 2] > s) {
for (i = 0; n / 2 >= i; i++) {
if (a[i] > s) {
num = num + a[i] - s;
}
}
} else if (a[n / 2] < s) {
for (i = n - 1; i >= n / 2; i--) {
if (a[i] < s) {
num = num + s - a[i];
}
}
}
printf("%lld", num);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int N = 200010;
int n, s, a[N];
int main() {
scanf("%d%d", &n, &s);
int m = n / 2 + 1;
for (int i = 1; i <= n; i++) {
scanf("%d", &a[i]);
}
sort(a + 1, a + n + 1);
if (a[m] == s) {
return puts("0"), 0;
} else if (a[m] > s) {
long long ans = 0;
for (int i = m; i; i--) {
if (a[i] > s) ans += a[i] - s;
}
cout << ans << endl;
} else {
long long ans = 0;
for (int i = m; i <= n; i++) {
if (a[i] < s) ans += s - a[i];
}
cout << ans << endl;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
#pragma GCC optimize("O3")
#pragma GCC target("sse4")
const double PI = acos(-1.0);
int mod = 998244353;
const long long INF = 1e9 + 47;
const long long LINF = INF * INF;
int a[200000];
int main() {
ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);
int n, s;
cin >> n >> s;
for (int i = 0; i < n; i++) cin >> a[i];
sort(a, a + n);
long long ans = 0;
int mid = n / 2;
ans += abs(a[mid] - s);
mid = n / 2 + 1;
while (mid < n && a[mid] < s) {
ans += abs(a[mid] - s);
mid++;
}
mid = n / 2 - 1;
while (mid >= 0 && a[mid] > s) {
ans += abs(a[mid] - s);
mid--;
}
cout << ans;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, s, i;
cin >> n >> s;
int a[n];
for (i = 0; i < n; i++) cin >> a[i];
sort(a, a + n);
long long ans1 = 0, ans2 = 0;
for (i = 0; i <= n / 2; i++) {
if (a[i] > s) {
ans1 += a[i] - s;
}
}
for (i = n / 2; i < n; i++) {
if (a[i] < s) {
ans2 += s - a[i];
}
}
cout << ans1 + ans2;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
long long a[1000010];
int main() {
long long n, s;
scanf("%lld %lld", &n, &s);
for (int i = 0; i < n; i++) {
scanf("%lld", &a[i]);
}
sort(a, a + n);
long long sum = 0;
long long x = n / 2;
if (a[x] < s) {
while (a[x] < s) {
sum += s - a[x];
x++;
if (x >= n) break;
}
} else if (a[x] > s) {
while (a[x] > s) {
sum += a[x] - s;
x--;
if (x < 0) break;
}
}
printf("%lld\n", sum);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const long long N = 2e5 + 5;
long long n, s, a[N];
signed main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
cin >> n >> s;
for (long long i = 0; i < n; i++) cin >> a[i];
sort(a, a + n);
long long mid = n / 2, ans = 0;
ans += abs(a[mid] - s);
for (long long i = mid + 1; i < n; i++) ans += max(0LL, s - a[i]);
for (long long i = 0; i < mid; i++) ans += max(0LL, a[i] - s);
cout << ans;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int maxn = 1e5 * 4;
inline int get() {
int x;
cin >> x;
return x;
}
inline long long getlong() {
long long x;
cin >> x;
return x;
}
inline string getString() {
string s;
cin >> s;
return s;
}
template <typename T>
inline vector<T> getvector(int len) {
vector<T> a(len);
for (auto &it : a) cin >> it;
return a;
}
inline vector<int> getvector(int len) {
vector<int> a(len);
for (auto &it : a) cin >> it;
return a;
}
inline vector<pair<int, int>> getvector_andPairCnt(int len) {
vector<pair<int, int>> a(len);
int i = 1;
for (auto &it : a) {
it.second = i;
i++;
cin >> it.first;
}
return a;
}
double power_log(double power, double val) { return log(val) / log(power); }
template <typename T>
int sqr(T x) {
return x * x;
}
template <typename T>
ostream &operator<<(ostream &os, const vector<T> &v) {
for (auto it : v) os << it << " ";
os << "\n";
return os;
}
template <typename T, typename H>
inline vector<pair<T, H>> getvector_andBiPair(int len) {
vector<pair<T, H>> a(len);
for (auto &it : a) {
cin >> it.first >> it.second;
}
return a;
}
template <typename T>
inline set<T> vector_to_set(const vector<T> &vec) {
set<T> s;
for (auto &it : vec) s.insert(it);
return s;
}
int main() {
int n = get(), s = get();
auto v = getvector(n);
sort(v.begin(), v.end());
long long ans = 0;
for (int i = 0; i < (n / 2); i++) {
if (v[i] > s) {
ans += abs(v[i] - s);
}
}
ans += abs(v[n / 2] - s);
for (int i = (n / 2) + 1; i < n; i++) {
if (v[i] < s) {
ans += abs(v[i] - s);
}
}
cout << ans;
}
|
#include <bits/stdc++.h>
using namespace std;
int32_t main() {
long long n, k;
cin >> n >> k;
long long arr[n];
for (long long i = 0; i < n; i++) cin >> arr[i];
sort(arr, arr + n);
long long c = 0;
vector<long long> sma, la;
long long ctr = 0;
long long ctr1 = 0;
for (long long i = 0; i < n; i++) {
if (arr[i] <= k) {
if (ctr < n / 2) {
ctr++;
} else
sma.push_back(arr[i]);
}
}
for (long long i = n - 1; i >= 0; i--) {
if (arr[i] >= k) {
if (ctr1 < n / 2) {
ctr1++;
} else
la.push_back(arr[i]);
}
}
long long z1 = sma.size(), z2 = la.size();
for (long long i = 0; i < z1; i++) c += abs(k - sma[i]);
for (long long i = 0; i < z2; i++) c += abs(k - la[i]);
cout << c;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const long long MAXN = 2e5 + 5;
long long a[MAXN];
long long n, s;
signed main() {
scanf("%lld%lld", &n, &s);
for (long long i = 1; i <= n; ++i) {
scanf("%lld", a + i);
}
sort(a + 1, a + 1 + n);
long long mid = (n + 1) / 2;
if (a[mid] == s) {
printf("%d\n", 0);
return 0;
}
long long ans = 0;
if (a[mid] < s) {
for (long long i = mid; i <= n; ++i) {
if (a[i] >= s) break;
ans += s - a[i];
}
} else {
for (long long i = mid; i >= 1; --i) {
if (a[i] <= s) break;
ans += a[i] - s;
}
}
printf("%lld\n", ans);
}
|
#include <bits/stdc++.h>
using namespace std;
const int inf_int = 1e9 + 100;
const long long inf_ll = 1e16;
const double pi = 3.1415926535898;
bool debug = 0;
const int MX = 6e6 + 1;
const int MAXN = 4e5 + 100;
const int LOG = 20;
const long long mod = 1e9 + 7;
void solve() {
int n, s;
cin >> n >> s;
vector<int> a;
for (int i = 1; i <= n; ++i) {
int x;
cin >> x;
a.push_back(x);
}
sort(a.begin(), a.end());
long long ans = 0;
if (a[n / 2] > s) {
for (int i = n / 2; i >= 0; --i) {
if (a[i] > s) {
ans += a[i] - s;
}
}
} else if (a[n / 2] < s) {
for (int i = n / 2; i < n; ++i) {
if (a[i] < s) {
ans += s - a[i];
}
}
}
cout << ans << "\n";
}
signed main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
cout.setf(ios::fixed);
cout.precision(20);
int t = 1;
while (t--) solve();
}
|
#include <bits/stdc++.h>
using namespace std;
int n, s;
int a[200005];
inline int read() {
int a = 0, f = 1;
char c = getchar();
while (c < '0' || c > '9') {
if (c == '-') f = -1;
c = getchar();
}
while (c >= '0' && c <= '9') {
a = a * 10 + c - '0';
c = getchar();
}
return a * f;
}
int main() {
n = read();
s = read();
for (int i = 1; i <= n; i++) a[i] = read();
sort(a + 1, a + n + 1);
int pos = (n + 1) / 2;
long long ans1, ans2;
ans1 = ans2 = 0;
for (int i = pos + 1; i <= n; i++)
if (a[i] < s)
ans1 += s - a[i];
else
break;
for (int i = pos - 1; i; i--)
if (a[i] > s)
ans2 += a[i] - s;
else
break;
cout << ans1 + ans2 + abs(a[pos] - s) << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
using ll = long long int;
using dl = double;
const int N = 2e5 + 10;
ll aarray[200000 + 10];
ll magic[101][101];
vector<ll> primes;
bool prime[1000001];
int main() {
ios_base::sync_with_stdio(false);
string str;
ll a, b, c, d, e, f, x, y, k, t, A = 0, B = 0, L, j, i, l, r, m, n, C = 0,
ans = 0, sum = 0, sum1 = 0;
vector<ll> v, v1;
queue<ll> qu;
cin >> n >> k;
for (i = 1; i <= n; i++) {
cin >> aarray[i];
}
sort(aarray, aarray + n + 1);
x = aarray[(n + 1) / 2];
A += abs(x - k);
if (x > k) {
for (i = 1; i <= (n / 2); i++) {
if (aarray[i] > k) {
A += abs(aarray[i] - k);
}
}
}
a = (n + 1) / 2;
a++;
ll flag = k;
for (i = a; i <= n; i++) {
if (aarray[i] < flag) {
A += abs(aarray[i] - flag);
} else {
flag = aarray[i];
}
}
cout << A << endl;
return 0;
}
|
#include <bits/stdc++.h>
#pragma comment(linker, "/STACK:500000000")
using namespace std;
int main() {
int n, i, s;
scanf("%d %d", &n, &s);
vector<int> a(n);
for (i = 0; i < n; i++) {
scanf("%d", &a[i]);
}
sort(a.begin(), a.end());
long long res = 0;
int pos = n / 2;
if (a[pos] <= s) {
for (i = pos; i < n; i++) res += max(0, s - a[i]);
} else {
for (i = 0; i <= pos; i++) res += max(0, a[i] - s);
}
cout << res << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
const int N = 2e5 + 5;
int a[N];
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
int n, k;
long long ans = 0;
cin >> n >> k;
for (int i = 0; i < n; i++) cin >> a[i];
sort(a, a + n);
for (int i = 0; i < n / 2; i++)
if (a[i] > k) ans += a[i] - k;
for (int i = n / 2 + 1; i < n; i++)
if (a[i] < k) ans += k - a[i];
ans += abs(a[n / 2] - k);
cout << ans << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
long long const mod = 1e9 + 7;
long long max(long long a, long long b) {
if (a > b) return a;
return b;
}
long long min(long long a, long long b) {
if (a < b) return a;
return b;
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
long long n, s;
cin >> n >> s;
long long a[n];
long long i;
for (i = 0; i < n; i++) {
cin >> a[i];
}
sort(a, a + n);
long long median = a[n / 2];
long long f1 = 0, f2 = 0;
for (i = 0; i < n / 2; i++) {
if (a[i] > s) {
f1 = f1 + a[i] - s;
}
if (a[n - 1 - i] < s) {
f2 = f2 + s - a[n - 1 - i];
}
}
cout << f1 + f2 + abs(median - s) << '\n';
}
|
#include <bits/stdc++.h>
using namespace std;
vector<int> b, s;
bool cmp(int a, int b) { return a > b; }
int main() {
int N, M, tmp;
long long ans = 0;
b.clear();
s.clear();
scanf("%d %d", &N, &M);
for (int i = 0; i < N; i++) {
scanf("%d", &tmp);
if (tmp > M)
b.push_back(tmp);
else
s.push_back(tmp);
}
sort(b.begin(), b.end(), cmp);
sort(s.begin(), s.end());
while (s.size() > (N >> 1)) {
ans += M - s.back();
s.pop_back();
}
while (b.size() > (N >> 1)) {
ans += b.back() - M;
b.pop_back();
}
printf("%lld\n", ans);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
long long s[5000000];
int main() {
long long n, k, i, a, b, c, z, count = 0;
cin >> n >> k;
a = b = c = 0;
for (i = 0; i < n; i++) {
cin >> s[i];
if (s[i] < k)
a++;
else if (s[i] == k)
b++;
else if (s[i] > k)
c++;
}
sort(s, s + n);
if (abs(a - c) < b)
cout << "0";
else if (a > c) {
z = a - (c + b);
if (z % 2 == 0)
z /= 2;
else
z = z / 2 + 1;
for (i = a - 1; i > a - 1 - z; i--) count += abs(s[i] - k);
cout << count;
} else if (a < c) {
z = c - (a + b);
if (z % 2 == 0)
z /= 2;
else
z = z / 2 + 1;
for (i = a + b; i < a + b + z; i++) count += abs(s[i] - k);
cout << count;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int a[200009];
int main() {
int n, s;
cin >> n >> s;
for (int i = 1; i <= n; i++) {
cin >> a[i];
}
sort(a + 1, a + n + 1);
int k = a[(n + 1) / 2];
if (s == k) {
cout << 0 << endl;
} else if (s > k) {
long long res = (long long)(s - k);
for (int i = n; i > (n + 1) / 2; i--) {
if (a[i] < s) {
res += (long long)(s - a[i]);
}
}
cout << res << endl;
} else {
long long res = (long long)(k - s);
for (int i = 1; i < (n + 1) / 2; i++) {
if (a[i] > s) {
res += (long long)(a[i] - s);
}
}
cout << res << endl;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
using li = long long;
using ld = long double;
void solve(bool);
signed main() {
cin.sync_with_stdio(false);
cin.tie(nullptr);
solve(true);
return 0;
}
void solve(bool __attribute__((unused)) read) {
li n, s;
cin >> n >> s;
vector<li> a(n);
for (li i = 0; i < n; ++i) {
cin >> a[i];
}
sort((a).begin(), (a).end());
li answer = 0;
if (a[n / 2] > s) {
for (li t = n / 2; t >= 0; --t) {
answer += max<li>(a[t] - s, 0);
}
} else {
for (li t = n / 2; t < n; ++t) {
answer += max<li>(s - a[t], 0);
}
}
cout << answer << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
int n, a[200010], S;
int main() {
scanf("%d%d", &n, &S);
for (int i = 1; i <= n; ++i) scanf("%d", &a[i]);
sort(a + 1, a + n + 1);
long long ans = 0;
for (int i = 1; i <= n / 2; ++i) {
if (a[i] > S) ans += a[i] - S;
if (a[n - i + 1] < S) ans += S - a[n - i + 1];
}
ans += abs(S - a[n / 2 + 1]);
printf("%I64d", ans);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, s;
cin >> n >> s;
int arr[n];
for (int i = 0; i < n; i++) {
cin >> arr[i];
}
int num = n / 2;
sort(arr, arr + n);
long long sum = 0;
for (int i = 0; i < n; i++) {
if (i < num) {
sum += max(0, arr[i] - s);
} else if (i == num) {
sum += abs(arr[i] - s);
} else if (i > num) {
sum += max(0, s - arr[i]);
}
}
cout << sum;
}
|
#include <bits/stdc++.h>
using namespace std;
long long ans, n, a[2000020], s;
int main() {
ios_base::sync_with_stdio(0);
cin >> n >> s;
for (long long i = 1; i <= n; i++) cin >> a[i];
sort(a + 1, a + n + 1);
if (a[n / 2 + 1] == s) {
cout << 0;
return 0;
}
if (s > a[n / 2 + 1]) {
for (long long i = n / 2 + 1; i <= n; i++)
if (s > a[i]) ans += s - a[i];
} else
for (long long i = n / 2 + 1; i >= 1; i--)
if (a[i] > s) ans += abs(s - a[i]);
cout << ans;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int arraySize;
int median;
scanf("%d %d", &arraySize, &median);
int arr[arraySize];
for (int i = 0; i < arraySize; i++) {
scanf("%d", &arr[i]);
}
sort(arr, arr + arraySize);
long long ans = 0;
if (arr[arraySize / 2] < median) {
for (int i = (arraySize / 2); i < arraySize; i++) {
if (arr[i] < median) {
ans += (long long)(median - arr[i]);
}
}
} else {
for (int i = (arraySize / 2); i >= 0; i--) {
if (arr[i] > median) {
ans += (long long)(arr[i] - median);
}
}
}
cout << ans << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
long long int n, m;
cin >> n >> m;
long long int a[n];
for (int i = 0; i < n; i++) {
cin >> a[i];
}
sort(a, a + n);
int k = n / 2;
long long int ans = 0;
if (a[k] < m) {
for (int i = k; i < n; i++) {
if (a[i] <= m) {
ans += (m - a[i]);
}
}
} else {
for (int i = k; i > -1; i--) {
if (a[i] >= m) {
ans += (a[i] - m);
}
}
}
cout << ans;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
cout.precision(20);
long long int n, s;
cin >> n >> s;
vector<long long int> v(n);
for (long long int i = 0; i < n; i++) cin >> v[i];
sort(v.begin(), v.end());
if (n == 1) {
cout << abs(s - v[0]);
return 0;
}
long long int p = n / 2;
if (v[p] == s) {
cout << 0;
return 0;
} else if (v[p] < s) {
long long int ans = 0;
ans += s - v[p];
long long int k = p + 1;
while (k < n && v[k] < s) {
ans += s - v[k];
k++;
}
cout << ans;
return 0;
} else {
long long int ans = 0;
ans += (v[p] - s);
long long int k = p - 1;
while (k >= 0 && v[k] > s) {
ans += (v[k] - s);
k--;
}
cout << ans;
return 0;
};
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int NMAX = 200000 + 5;
int n, s, a[NMAX];
int main() {
scanf("%d %d", &n, &s);
for (int i = 0; i < n; ++i) scanf("%d", &a[i]);
sort(a, a + n);
int mid = n / 2;
if (a[mid] == s) {
cout << 0 << '\n';
} else {
long long cnt = 0;
if (a[mid] < s) {
for (; mid < n && a[mid] < s; ++mid) cnt += (long long)s - a[mid];
} else {
for (; mid >= 0 && a[mid] > s; --mid) cnt += (long long)a[mid] - s;
}
cout << cnt << '\n';
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
long long n, s, mins = 2100000000, ans;
int a[1000010];
int main() {
scanf("%I64d%I64d", &n, &s);
for (int i = 1; i <= n; i++) cin >> a[i];
mins = (n + 1) / 2;
sort(a + 1, a + 1 + n);
for (int i = 1; i <= mins; i++)
if (a[i] > s) ans = ans + a[i] - s;
for (int i = mins; i <= n; i++)
if (a[i] < s) ans = ans + s - a[i];
cout << ans;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int n;
long long s, ans;
long long arr[300001];
int main() {
scanf("%lld%lld", &n, &s);
const long long mx = 1e18;
for (int i = 0; i < n; i++) {
scanf("%lld", &arr[i]);
}
int cur = n / 2;
sort(arr, arr + n);
long long lo, hi;
lo = hi = 0;
for (int i = cur; i < n; i++) {
if (s <= arr[i]) break;
hi += abs(s - arr[i]);
}
for (int i = cur; i >= 0; i--) {
if (s >= arr[i]) break;
lo += abs(s - arr[i]);
}
if (arr[cur] < s)
printf("%lld\n", hi);
else if (arr[cur] > s)
printf("%lld\n", lo);
else
printf("%lld\n", min(lo, hi));
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
bool comp(pair<long long, long long> a, pair<long long, long long> b) {
if (a.second < b.second)
return true;
else
return false;
}
int main() {
long long n, s;
cin >> n >> s;
long long a[n];
for (long long i = 0; i < n; i++) cin >> a[i];
sort(a, a + n);
if (s == a[n / 2])
cout << 0;
else if (s > a[n / 2]) {
long long c = 0;
for (long long i = n / 2; i < n; i++) {
if (a[i] > s)
break;
else
c += abs(a[i] - s);
}
cout << c;
} else {
long long c = 0;
for (long long i = n / 2; i >= 0; i--) {
if (a[i] < s)
break;
else
c += abs(a[i] - s);
}
cout << c;
}
}
|
#include <bits/stdc++.h>
using namespace std;
const int inf = 0x3f3f3f3f;
long long n, s, res;
int a[200005];
int main(void) {
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
while (cin >> n >> s) {
res = 0;
for (int i = 1; i <= n; i++) {
cin >> a[i];
}
sort(a + 1, a + n + 1);
int mid = n / 2 + 1;
for (int i = mid; i <= n; i++) {
if (a[i] < s)
res += (s - a[i]);
else
break;
}
for (int i = mid; i >= 1; i--) {
if (a[i] > s)
res += (a[i] - s);
else
break;
}
cout << res << endl;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int long a;
int long long b;
cin >> a >> b;
int long long c[a];
for (int i = 0; i < a; i++) {
cin >> c[i];
}
sort(c, c + a);
if (c[(a - 1) / 2] == b) {
cout << 0;
return 0;
}
if (c[(a - 1) / 2] < b) {
int long long sum = 0;
for (int i = (a - 1) / 2; i < a; i++) {
if (c[i] < b) {
sum += b - c[i];
} else {
break;
}
}
cout << sum;
return 0;
} else {
int long long sum = 0;
for (int i = (a - 1) / 2; i >= 0; i--) {
if (c[i] > b) {
sum += c[i] - b;
} else {
break;
}
}
cout << sum;
}
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, s;
cin >> n >> s;
vector<int> arr(n, 0);
for (int i = 0; i < n; i++) {
cin >> arr[i];
}
if (n == 1) {
cout << abs(arr[0] - s);
return 0;
}
sort(arr.begin(), arr.begin() + n);
int med = n / 2;
long long minOp = abs(s - arr[med]);
for (int i = med - 1; i >= 0; i--) {
if (arr[i] > s) {
minOp += abs(s - arr[i]);
} else {
break;
}
}
for (int i = med + 1; i < n; i++) {
if (arr[i] < s) {
minOp += abs(s - arr[i]);
} else {
break;
}
}
cout << minOp << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
int n, k;
cin >> n >> k;
long long a[n], p = 0;
int t = n / 2;
for (int x = 0; x < n; x++) cin >> a[x];
sort(a, a + n);
if (a[t] == k) {
cout << 0;
return 0;
} else if (a[t] < k) {
p += k - a[t];
for (int x = t + 1; x < n; x++) {
if (a[x] < k)
p += k - a[x];
else {
cout << p;
return 0;
}
}
} else {
p += a[t] - k;
for (int x = t - 1; x >= 0; x--) {
if (a[x] > k)
p += a[x] - k;
else {
cout << p;
return 0;
}
}
}
cout << p;
}
|
#include <bits/stdc++.h>
using namespace std;
const int maxn = 2e5 + 10;
long long nu[maxn];
int main() {
int n;
long long s;
scanf("%d %lld", &n, &s);
for (int i = 1; i <= n; ++i) {
scanf("%lld", &nu[i]);
}
sort(nu + 1, nu + 1 + n);
int mid = n / 2 + 1;
long long ans = 0;
for (int i = mid; i <= n; ++i) {
if (nu[i] < s) {
ans += s - nu[i];
}
}
for (int i = 1; i <= mid; ++i) {
if (nu[i] > s) {
ans += nu[i] - s;
}
}
printf("%lld\n", ans);
}
|
#include <bits/stdc++.h>
using namespace std;
int a[200010];
int main() {
int n, s;
cin >> n >> s;
for (int i = 1; i <= n; i++) {
cin >> a[i];
}
sort(a + 1, a + n + 1);
int mid = n / 2 + 1;
if (s == a[mid]) {
cout << 0 << endl;
} else if (s < a[mid]) {
int t = mid;
while (t >= 1 && a[t] > s) {
t -= 1;
}
t += 1;
long long res = 0;
for (int i = t; i <= mid; i++) {
res += a[i] - s;
}
cout << res << endl;
} else if (s > a[mid]) {
int t = mid;
while (t <= n && a[t] < s) {
t += 1;
}
t -= 1;
long long res = 0;
for (int i = mid; i <= t; i++) {
res += s - a[i];
}
cout << res << endl;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
long long int n, m, a, b, c, d, k, x, y, z, ans = 0, total = 0;
long long int arr[201000] = {0};
int main(void) {
cin >> n >> m;
for (int i = 0; i < n; i++) cin >> arr[i];
sort(arr, arr + n);
a = (n / 2);
ans += abs(arr[a] - m);
for (int i = a + 1; i < n; i++) {
if (arr[i] < m) {
ans += abs(arr[i] - m);
} else {
break;
}
}
for (int i = a - 1; i >= 0; i--) {
if (arr[i] > m) {
ans += abs(arr[i] - m);
} else {
break;
}
}
cout << ans << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int A[200005];
int main() {
ios::sync_with_stdio(0);
cin.tie(NULL), cout.tie(NULL);
int N, S;
cin >> N >> S;
for (int i = 1; i <= N; i++) cin >> A[i];
sort(A + 1, A + 1 + N);
int mid = (N + 1) / 2;
long long ans = 0;
if (A[mid] >= S) {
for (int i = mid; i >= 1 && A[i] > S; i--) ans += (A[i] - S);
} else {
for (int i = mid; i <= N && A[i] < S; i++) ans += (S - A[i]);
}
cout << ans << "\n";
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
long long n, s;
cin >> n >> s;
vector<long long> A(n);
for (long long i = 0; i < n; i++) {
cin >> A[i];
}
sort(A.begin(), A.end());
long long m = (n - 1) / 2;
long long score = 0;
if (A[m] < s) {
for (long long i = m; i < n; i++) {
if (A[i] < s) {
score += (s - A[i]);
}
}
} else {
for (long long i = m; i >= 0; i--) {
if (A[i] > s) {
score += (A[i] - s);
}
}
}
cout << score;
return 0;
}
|
#include <bits/stdc++.h>
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
using namespace std;
const int MAX_N = 200005;
int n;
long long s;
long long a[MAX_N];
int main() {
ios::sync_with_stdio(false);
cin >> n >> s;
for (int i = 0; i < n; i++) cin >> a[i];
sort(a, a + n);
int mid = n / 2;
long long result = abs(a[mid] - s);
for (int i = mid - 1; i >= 0; i--)
if (a[i] > s) result += a[i] - s;
for (int i = mid + 1; i < n; i++)
if (a[i] < s) result += s - a[i];
cout << result << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
long int m;
cin >> n >> m;
long int a[n];
for (int i = 0; i < n; i++) cin >> a[i];
sort(a, a + n);
long long int ans = 0;
if (a[n / 2] < m) {
for (int i = n - 1; i >= n / 2; i--) {
if (a[i] < m) ans += (m - a[i]);
}
} else if (a[n / 2] > m) {
for (int i = 0; i <= n / 2; i++) {
if (a[i] > m) ans += (a[i] - m);
}
}
cout << ans;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
long n, s;
cin >> n >> s;
long arr[n];
for (long i = 0; i < n; i++) {
cin >> arr[i];
}
sort(arr, arr + n);
long h = n / 2;
long long c = 0;
if (arr[h] == s) {
c = 0;
} else if (s > arr[h]) {
long i = h;
while (i < n) {
if (arr[i] >= s) {
break;
} else {
long k = s - arr[i];
c += k;
}
i++;
}
} else {
long i = h;
while (i >= 0) {
if (arr[i] <= s) {
break;
} else {
long k = arr[i] - s;
c += k;
}
i--;
}
}
cout << c;
}
|
#include <bits/stdc++.h>
using namespace std;
long long int power(long long int a, long long int b) {
long long int ans = 1;
while (b > 0) {
if (b & 1) ans = (ans * a);
b = b >> 1;
a = (a * a);
}
return ans;
}
long long int modInverse(long long int n, long long int m,
long long int mod = 1000000007) {
return power(n, m - 2) % mod;
}
long long int sieve[1000001];
void factors(long long int num, set<long long int> &s) {
if (num <= 1) return;
s.insert(sieve[num]);
factors(num / sieve[num], s);
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
long long int n, s;
cin >> n >> s;
long long int a[n];
for (long long int i = 0; i < n; i++) cin >> a[i];
sort(a, a + n);
long long int ans = 0;
if (a[n / 2] < s) {
for (long long int i = n / 2; i < n; i++) {
if (a[i] < s) ans += abs(a[i] - s);
}
} else if (a[n / 2] > s) {
for (long long int i = n / 2; i >= 0; i--) {
if (a[i] > s) ans += abs(a[i] - s);
}
}
cout << ans << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int mod = 1e9 + 7;
int main() {
ios::sync_with_stdio(false);
long long int n, k, a;
cin >> n >> k;
vector<long long int> nums, vals;
long long int med;
for (int i = 0; i < n; i++) {
cin >> a;
nums.push_back(a);
}
vals = nums;
long long int ans = 0;
sort(vals.begin(), vals.end());
med = vals[n / 2];
if (med == k) return cout << 0, 0;
if (med < k) {
for (int i = n / 2; i < n; i++) {
if (vals[i] >= k)
break;
else
ans = ans + k - vals[i];
}
return cout << ans, 0;
}
for (int i = n / 2; i >= 0; i--) {
if (vals[i] <= k)
break;
else
ans = ans + vals[i] - k;
}
return cout << ans, 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
long long n, m, t, i, ans = 0;
cin >> n >> m;
vector<long long> vec(n);
for (auto &i : vec) cin >> i;
sort(vec.begin(), vec.end());
i = n / 2;
while (i >= 0 && vec[i] > m) ans += vec[i] - m, i--;
i = n / 2;
while (i < n && vec[i] < m) ans += m - vec[i], i++;
cout << ans << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
vector<int> sm, gr;
int main() {
int n, s, a;
long long ans = 0;
scanf("%d %d", &n, &s);
for (int i = 0; i < n; i++) {
scanf("%d", &a);
if (a <= s)
sm.push_back(a);
else
gr.push_back(a);
}
if ((int)sm.size() > (int)gr.size()) {
sort(sm.begin(), sm.end());
while ((int)sm.size() > n / 2) ans += s - sm.back(), sm.pop_back();
} else {
sort(gr.begin(), gr.end(), greater<int>());
while ((int)gr.size() > n / 2) ans += gr.back() - s, gr.pop_back();
}
printf("%I64d\n", ans);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
long long int a[1000000], i, n, m, s = 0, b;
cin >> n >> m;
for (i = 0; i < n; i++) {
cin >> a[i];
}
sort(a, a + n);
b = n / 2;
if (a[b] == m) {
cout << 0;
return 0;
} else if (a[b] < m) {
for (i = b; i < n; i++) {
if (a[i] < m) {
s = s + (m - a[i]);
} else {
cout << s;
return 0;
}
}
} else {
for (i = b; i >= 0; i--) {
if (a[i] > m) {
s = s + (a[i] - m);
} else {
cout << s;
return 0;
}
}
}
cout << s;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int MAXN = 2e5 + 11;
long long ans;
int n, m;
int arr[MAXN];
int main() {
cin >> n >> m;
for (int i = 0; i < n; ++i) cin >> arr[i];
sort(arr, arr + n);
if (arr[n / 2] < m) {
for (int i = n / 2; i < n && arr[i] < m; ++i) ans += m - arr[i];
} else {
for (int i = n / 2; i >= 0 && arr[i] > m; --i) ans += arr[i] - m;
}
cout << ans << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
template <class T>
T max3(T a, T b, T c) {
return max(a, max(b, c));
}
void solve() {
long long n, s;
cin >> n >> s;
vector<long long> v(n, 0);
for (auto &i : v) cin >> i;
long long ans = 0;
sort(v.begin(), v.end());
if (v[n / 2] == s) {
cout << "0" << '\n';
return;
}
if (v[n / 2] < s) {
for (long long i = n / 2; i < n; i++) {
if (v[i] >= s) {
cout << ans << '\n';
return;
}
ans += s - v[i];
}
} else {
for (long long i = n / 2; i >= 0; i--) {
if (v[i] <= s) {
cout << ans << '\n';
return;
}
ans += v[i] - s;
}
}
cout << ans << '\n';
return;
}
signed main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
;
solve();
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, s;
cin >> n >> s;
vector<int> a(n);
for (int i = 0; i < n; i++) {
cin >> a[i];
}
sort(a.begin(), a.end());
int k = (n - 1) / 2;
long long r = 0;
if (a[k] > s) {
int w = 0;
for (int i = k; i > -1; i--) {
if (a[i] >= s && i > 0 && a[i - 1] < s) {
w = i;
break;
}
if (i == 0) {
w = 0;
}
}
for (int i = w; i <= k; i++) {
r = r + a[i] - s;
}
}
if (a[k] < s) {
int w = 0;
for (int i = k; i < n; i++) {
if (a[i] <= s && i < n - 1 && a[i + 1] > s) {
w = i;
break;
}
if (i == n - 1) {
w = n - 1;
}
}
for (int i = w; i >= k; i--) {
r = r - a[i] + s;
}
}
cout << r;
return 0;
}
|
#include <bits/stdc++.h>
const int maxn = 2e5 + 5;
const int mod = 1e9 + 7;
const int inf = 0x3f3f3f3f;
using namespace std;
long long n, s;
long long a[maxn];
int main() {
scanf("%lld %lld", &n, &s);
for (int i = 0; i < n; i++) scanf("%lld", &a[i]);
sort(a, a + n);
long long sum = abs(a[n / 2] - s);
for (int i = n / 2 + 1; i < n; i++) {
if (a[i] < s)
sum += s - a[i];
else
break;
}
for (int i = n / 2 - 1; i >= 0; i--) {
if (a[i] > s)
sum += a[i] - s;
else
break;
}
printf("%lld\n", sum);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int MOD = 1e9 + 7;
const int INF = 0x3f3f3f3f;
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
int n, s;
cin >> n >> s;
vector<int> a(n);
for (int i = 0; i < n; i++) {
cin >> a[i];
}
sort(a.begin(), a.end());
int k = n / 2;
long long ans = 0;
if (a[k] > s) {
for (; k >= 0 && a[k] > s; k--) {
ans += abs(s - a[k]);
}
} else {
for (; k < n && a[k] < s; k++) {
ans += abs(s - a[k]);
}
}
cout << ans << '\n';
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
vector<long long int> vec;
int main() {
long long int result = 0, i, sz, median, inp, mid_array;
while (cin >> sz >> median) {
vec.clear();
result = 0;
for (i = 0; i < sz; i++) {
cin >> inp;
vec.push_back(inp);
}
sort(vec.begin(), vec.end());
mid_array = vec[sz / 2];
if (mid_array == median) {
cout << 0 << endl;
} else if (mid_array > median) {
for (i = sz / 2; i >= 0; i--) {
if (vec[i] > median) {
result += vec[i] - median;
} else
break;
}
cout << result << endl;
continue;
} else if (mid_array < median) {
for (i = sz / 2; i < sz; i++) {
if (vec[i] < median) {
result += median - vec[i];
} else
break;
}
cout << result << endl;
continue;
}
}
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
long long n, s, cnt = 0;
cin >> n >> s;
long long a[n];
for (long long i = 0; i < n; i++) cin >> a[i];
sort(a, a + n);
long long i = n / 2;
if (s > a[i])
while (a[i] < s && i < n) {
cnt = cnt + abs(s - a[i]);
i++;
}
else
while (a[i] > s && i >= 0) {
cnt = cnt + (a[i] - s);
i--;
}
cout << cnt;
}
|
#include <bits/stdc++.h>
using namespace std;
int gcd(int a, int b) {
if (a == 0) return b;
return gcd(b % a, a);
}
int modpow(int x, int n) {
int result = 1;
while (n > 0) {
if (n % 2 == 1)
result = ((result % 1000000007) * (x % 1000000007)) % 1000000007;
x = ((x % 1000000007) * (x % 1000000007)) % 1000000007;
n = n / 2;
}
return result;
}
int lcm(int a, int b) { return (a * b) / (gcd(a, b)); }
bool isprime(int n) {
if (n < 2) return false;
for (int i = 2; i <= sqrt(n); i++)
if (n % i == 0) return false;
return true;
}
int ctoi(char c) { return c - 48; }
bool visited[1000000]{false};
void add_edge(vector<int> v[], int x, int y) {
v[x].push_back(y);
v[y].push_back(x);
}
void dfs(vector<int> v[], int e) {
visited[e] = true;
for (int i = 0; i < v[e].size(); i++) {
if (!visited[v[e][i]]) {
dfs(v, v[e][i]);
}
}
}
int func(int n) {
if (isprime(n)) {
return 2 * n;
} else {
int idx = 0;
for (int i = 2; i <= n; i++) {
if (n % i == 0) {
idx = i;
break;
}
}
return (idx + n);
}
}
void showlist(list<int> g) {
list<int>::iterator it;
for (it = g.begin(); it != g.end(); ++it) cout << '\t' << *it;
cout << '\n';
}
signed main() {
long long int n, s;
cin >> n >> s;
long long int a[n];
for (int i = 0; i < n; i++) cin >> a[i];
sort(a, a + n);
long long int sum = 0;
if (a[n / 2] < s) {
int i = n / 2;
while (a[i] < s && i < n) {
sum += s - a[i];
i++;
}
} else if (a[n / 2] > s) {
int i = n / 2;
while (a[i] > s && i >= 0) {
sum += a[i] - s;
i--;
}
}
cout << sum << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
inline int read() {
char c = getchar();
int x = 0, f = 1;
while (c < '0' || c > '9') {
if (c == '-') f = -1;
c = getchar();
}
while (c >= '0' && c <= '9') x = x * 10 + c - '0', c = getchar();
return x * f;
}
int a[200005];
int n, s;
long long ans;
int main() {
cin >> n >> s;
for (int i = 1; i <= n; i++) scanf("%d", &a[i]);
sort(a + 1, a + n + 1);
int mid = n + 1 >> 1;
ans = abs(s - a[mid]);
for (int i = 1; i < mid; i++)
if (a[i] > s) ans += a[i] - s;
for (int i = mid + 1; i <= n; i++)
if (a[i] < s) ans += s - a[i];
cout << ans << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int n, s, a[200309];
int main() {
while (scanf("%d %d", &n, &s) != EOF) {
for (int i = 0; (i) < int(n); (i)++) scanf("%d", &a[i]);
sort(a, a + n);
int m = n / 2;
long long ans = abs(a[m] - s);
a[m] = s;
for (int i = m + 1; i < n; i++) {
if (a[i] < a[i - 1]) {
ans += abs(a[i] - a[i - 1]);
a[i] = a[i - 1];
}
}
for (int i = m - 1; i >= 0; i--) {
if (a[i] > a[i + 1]) {
ans += abs(a[i] - a[i + 1]);
a[i] = a[i + 1];
}
}
printf("%lld\n", ans);
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
long long n, m;
cin >> n >> m;
long long a[n];
long long i;
vector<long long> v;
long long c1 = 0;
for (i = 0; i < n; i++) {
cin >> a[i];
if (a[i] >= m) {
c1++;
}
if (abs(a[i] - m) != 0) v.push_back(abs(a[i] - m));
}
sort(v.begin(), v.end());
sort(a, a + n);
long long mid;
mid = n / 2;
long long ans = 0;
ans += abs(a[mid] - m);
for (i = 0; i < n; i++) {
if (i != mid && i < mid && a[i] > m) {
ans += a[i] - m;
} else if (i != mid && i > mid && a[i] < m) {
ans += m - a[i];
}
}
cout << ans;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
signed main() {
ios_base::sync_with_stdio(false), cin.tie(NULL), cout.tie(NULL);
long long n, s;
cin >> n >> s;
vector<long long> v(n);
for (long long i = 0; i < n; i++) cin >> v[i];
sort(v.begin(), v.end());
long long midpos = (n - 1) / 2;
long long ans = 0;
for (long long i = midpos; i >= 0; i--) {
if (v[i] >= s) {
ans += (v[i] - s);
v[i] = s;
}
}
for (long long i = midpos; i < n; i++) {
if (v[i] <= s) {
ans += (s - v[i]);
v[i] = s;
}
}
cout << ans << endl;
return 0;
}
|
#include <bits/stdc++.h>
int a[200000];
long long int c;
void quickSort(int arr[], int left, int right) {
int i = left, j = right;
int tmp;
int pivot = arr[(left + right) / 2];
while (i <= j) {
while (arr[i] < pivot) i++;
while (arr[j] > pivot) j--;
if (i <= j) {
tmp = arr[i];
arr[i] = arr[j];
arr[j] = tmp;
i++;
j--;
}
};
if (left < j) quickSort(arr, left, j);
if (i < right) quickSort(arr, i, right);
}
int main() {
int i, j, n, s, t, mid;
while (scanf("%d%d", &n, &s) != EOF) {
for (i = 0; i < n; i++) scanf("%d", &a[i]);
quickSort(a, 0, n - 1);
mid = n / 2;
c = 0;
if (a[mid] < s) {
for (i = mid; a[i] < s && i < n; i++) c += s - a[i];
} else if (a[mid] > s) {
for (i = mid; a[i] > s && i >= 0; i--) c += a[i] - s;
}
printf("%lld\n", c);
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, s;
cin >> n >> s;
int a[n];
long long d = 0;
for (int i = 0; i < n; i++) cin >> a[i];
sort(a, a + n);
d += abs(s - a[n / 2]);
a[n / 2] = s;
for (int i = n / 2 + 1; i < n; i++) {
if (a[i] < a[i - 1]) {
d += abs(s - a[i]);
a[i] = s;
}
}
for (int i = n / 2 - 1; i >= 0; i--) {
if (a[i] > a[i + 1]) {
d += abs(s - a[i]);
a[i] = s;
}
}
cout << d;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int maxn = 200005;
int a[maxn], s, n;
int main() {
scanf("%d%d", &n, &s);
for (int i = 0; i < n; i++) scanf("%d", &a[i]);
sort(a, a + n);
long long ans = 0;
int k = n / 2, key = a[k] > s ? -1 : 1;
for (int i = k; i >= 0 && i < n; i += key) {
if ((key == 1 && a[i] >= s) || (key == -1 && a[i] <= s)) break;
ans += abs(a[i] - s);
}
printf("%lld\n", ans);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
long long n, s;
cin >> n >> s;
long long count = 0;
long long arr[n];
for (long long i = 0; i < n; i++) {
cin >> arr[i];
}
sort(arr, arr + n);
long long mid = n / 2;
count += abs(arr[mid] - s);
arr[mid] = s;
for (long long i = mid - 1; i >= 0; i--) {
if (arr[i] > arr[i + 1]) {
count += abs(arr[i] - arr[i + 1]);
arr[i] = arr[i + 1];
}
}
for (long long i = mid + 1; i < n; i++) {
if (arr[i] < arr[i - 1]) {
count += abs(arr[i] - arr[i - 1]);
arr[i] = arr[i - 1];
}
}
cout << count;
}
|
#include <bits/stdc++.h>
using namespace std;
int n;
long long s;
long long a[300005];
long long ans = 0;
int main() {
int i, j;
scanf("%d%lld", &n, &s);
for (i = 1; i <= n; i++) scanf("%lld", &a[i]);
sort(a + 1, a + n + 1);
if (a[n / 2 + 1] >= s) {
for (i = 1; i <= n / 2 + 1; i++)
if (a[i] > s) ans += a[i] - s;
} else {
for (i = n / 2 + 1; i <= n; i++)
if (a[i] < s) ans += s - a[i];
}
printf("%lld", ans);
}
|
#include <bits/stdc++.h>
using namespace std;
bool strcm(string a, string b) {
bool fl = true;
if (a.length() != b.length()) {
fl = false;
return fl;
}
for (int i = 0; i < a.length(); i++) {
if (a[i] != b[i]) {
fl = true;
break;
}
}
return fl;
}
int main() {
int n, s;
cin >> n >> s;
long long int ar[n];
for (int i = 0; i < n; i++) cin >> ar[i];
sort(ar, ar + n);
long long int ans = 0;
for (int i = n / 2; i < n; i++) {
if (ar[i] < s) {
ans += abs(ar[i] - s);
}
}
for (int i = n / 2; i >= 0; i--) {
if (ar[i] > s) {
ans += ar[i] - s;
}
}
cout << ans << "\n";
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
long long n, k;
cin >> n >> k;
long long arr[n];
for (long long i = 0; i < n; i++) cin >> arr[i];
sort(arr, arr + n);
long long dex = n / 2;
if (arr[dex] == k) {
cout << 0 << endl;
} else if (arr[dex] > k) {
long long ans = 0;
for (long long i = dex; i >= 0; i--) {
if (arr[i] < k) break;
ans = ans + arr[i] - k;
}
cout << ans << endl;
} else {
long long ans = 0;
for (long long i = dex; i < n; i++) {
if (arr[i] > k) break;
ans = ans + k - arr[i];
}
cout << ans << endl;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int maxn = 200010;
int a[maxn];
int main() {
int n, m;
long long ans = 0;
scanf("%d%d", &n, &m);
for (int i = 1; i <= n; i++) scanf("%d", &a[i]);
sort(a + 1, a + 1 + n);
if (a[n / 2 + 1] < m) {
for (int i = n / 2 + 1; i <= n; i++) {
ans += max(0, m - a[i]);
}
} else if (a[n / 2 + 1] > m) {
for (int i = n / 2 + 1; i >= 1; i--) {
ans += max(0, a[i] - m);
}
}
printf("%lld\n", ans);
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
long long int n, s;
cin >> n >> s;
long long int k = 0;
vector<long long int> a(n);
for (int i = 0; i < n; i++) {
cin >> a[i];
}
sort(a.begin(), a.end());
if (a[n / 2] > s) {
for (int i = 0; i <= n / 2; i++) {
if (a[i] > s) {
k = k + a[i] - s;
}
}
} else {
for (int i = n / 2; i < n; i++) {
if (a[i] < s) {
k = k + s - a[i];
}
}
}
cout << k;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, s, i, a[200010];
long long ans = 0;
cin >> n >> s;
for (i = 1; i <= n; i++) cin >> a[i];
sort(a + 1, a + n + 1);
for (i = 1; i <= n / 2; i++) {
a[i] > s ? ans += a[i] - s : 0;
a[n - i + 1] < s ? ans += s - a[n - i + 1] : 1;
}
ans += abs(s - a[n / 2 + 1]);
cout << ans << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
long long i, j, k, l, m, n;
while (cin >> m >> n) {
int x[m];
for (i = 0; i < m; i++) {
scanf("%d", &x[i]);
}
sort(x, x + m);
j = 0;
l = m / 2;
for (i = 0; i < m; i++) {
if (i < l && x[i] > n)
j += (x[i] - n);
else if (i == l)
j += abs(x[i] - n);
else if (i > l && x[i] < n)
j += (n - x[i]);
}
cout << j << endl;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
long long sum = 0, n, k, i, j;
cin >> n >> k;
long long a[n];
for (i = 0; i < n; i++) cin >> a[i];
sort(a, a + n);
if (a[n / 2] > k) {
for (i = 0; i <= n / 2; i++) {
if (a[i] > k) sum = sum + a[i] - k;
}
} else {
for (i = n / 2; i < n; i++) {
if (a[i] < k) sum = sum + k - a[i];
}
}
cout << sum;
}
|
#include <bits/stdc++.h>
using namespace std;
int N;
int S;
int A[200010];
int main() {
ios_base::sync_with_stdio(false);
cin >> N >> S;
for (int i = 1; i <= N; i++) {
cin >> A[i];
}
sort(A + 1, A + 1 + N);
if (A[N / 2 + 1] == S) {
cout << "0" << endl;
} else {
if (A[N / 2 + 1] > S) {
long long fans = 0;
long long cnt = 0;
for (int i = 1; i <= N / 2 + 1; i++) {
if (A[i] <= S) {
} else {
cnt++;
fans += A[i];
}
}
cout << fans - cnt * S << endl;
} else {
long long fans = 0;
long long cnt = 0;
for (int i = N; i >= N / 2 + 1; i--) {
if (A[i] >= S) {
} else {
cnt++;
fans += A[i];
}
}
cout << cnt * S - fans << endl;
}
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
long long a[1000005], s, n, sum;
int main() {
cin >> n >> s;
for (int i = 1; i <= n; i++) {
cin >> a[i];
}
sort(a + 1, a + 1 + n);
int mid = (n + 1) / 2;
if (a[mid] > s) {
for (int i = mid; i > 0 && a[i] > s; i--) {
sum += a[i] - s;
}
cout << sum << endl;
} else if (a[mid] < s) {
for (int i = mid; i <= n && a[i] < s; i++) {
sum += s - a[i];
}
cout << sum << endl;
} else {
cout << 0 << endl;
return 0;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
long long n, i, s, a[300001];
int main() {
cin >> n >> s;
for (i = 0; i < n; i++) {
cin >> a[i];
}
sort(a, a + n);
long long k = n / 2, ans = 0;
for (i = 0; i <= k; i++) {
ans += max((long long)0, a[i] - s);
}
for (i = k; i < n; i++) {
ans += max((long long)0, s - a[i]);
}
cout << ans << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
const int maxn = 1e6 + 2;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
long long int i, j, ans = 0, n, k, arr[maxn];
cin >> n >> k;
for (i = 0; i < n; ++i) cin >> arr[i];
sort(arr, arr + n);
long long int temp = arr[n / 2];
if (temp - k < 0) {
for (i = n / 2; i < n; ++i) {
if (arr[i] < k) ans += k - arr[i];
}
} else {
for (i = n / 2; i >= 0; --i) {
if (arr[i] > k) ans += -k + arr[i];
}
}
cout << ans;
}
|
#include <bits/stdc++.h>
using namespace std;
const long long mod = 998244353;
const long double pi = acos((long double)-1);
long long gcd(long long a, long long b) { return b ? gcd(b, a % b) : a; }
long long num_generator() { return rand() % 1000; }
void array_generator(long long a[], long long n) {
for (long long i = 0; i < n; i++) a[i] = rand() % 100;
}
void solve() {
long long n, k;
cin >> n >> k;
long long a[n];
for (long long i = 0; i < n; i++) cin >> a[i];
sort(a, a + n);
long long ind = n / 2, cnt = 0;
for (long long i = 0; i < n; i++) {
if (i == ind) {
cnt += abs(a[i] - k);
} else if (i < ind) {
if (a[i] > k) cnt += abs(a[i] - k);
} else {
if (a[i] < k) cnt += abs(a[i] - k);
}
}
cout << cnt;
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
solve();
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
;
long long n, s, x;
cin >> n >> s;
vector<long long> v(n);
for (long long i = 0; i < n; i++) cin >> v[i];
sort(v.begin(), v.end());
long long key = v[n / 2];
long long sum = 0;
if (key == s) {
cout << 0;
return 0;
} else if (key < s) {
for (long long i = n / 2; i < n; i++) {
if (v[i] <= s)
sum = sum + s - v[i];
else
break;
}
} else {
for (long long i = n / 2; i >= 0; i--) {
if (v[i] >= s)
sum = sum + v[i] - s;
else
break;
}
}
cout << sum;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
long long n, s, ans = 0;
cin >> n >> s;
vector<long long> a;
for (long long x; cin >> x;) a.push_back(x);
sort(a.begin(), a.end());
for (long long i = 0; i < n; ++i) {
if (i == n / 2)
ans += abs(a[i] - s);
else if (i < n / 2) {
if (a[i] > s) ans += a[i] - s;
} else {
if (a[i] < s) ans += s - a[i];
}
}
cout << ans << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
vector<vector<int> > gr(200000);
int main() {
int n, s;
cin >> n >> s;
vector<int> arr(n);
for (int i = 0; i < n; ++i) {
int a;
cin >> a;
arr[i] = a;
}
sort(arr.begin(), arr.end());
if (arr[n / 2] == s) {
cout << 0;
} else {
if (arr[n / 2] > s) {
int64_t ans = 0;
for (int i = n / 2; i >= 0; --i) {
if (arr[i] > s)
ans += arr[i] - s;
else
break;
}
cout << ans;
} else {
int64_t ans = 0;
for (int i = n / 2; i < n; ++i) {
if (arr[i] < s)
ans += s - arr[i];
else
break;
}
cout << ans;
}
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
long long int modPow(long long int x, long long int y, long long int p) {
long long int res = 1;
x = x % p;
while (y > 0) {
if (y & 1) res = (res * x) % p;
y = y >> 1;
x = (x * x) % p;
}
return res;
}
long long int arr[200005];
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
;
long long int n, m;
cin >> n >> m;
for (int i = 0; i < n; i++) cin >> arr[i];
sort(arr, arr + n);
long long int curr = arr[n / 2], ans = 0;
if (curr == m) {
cout << 0;
return 0;
} else if (curr < m) {
for (int i = n / 2; i < n; i++) {
if (arr[i] < m) ans += m - arr[i];
}
} else {
for (int i = n / 2; i >= 0; i--) {
if (arr[i] > m) ans += arr[i] - m;
}
}
cout << ans << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int INF = 0x3f3f3f3f;
const long long LINF = 0x3f3f3f3f3f3f3f3fll;
const long double pi = acos(-1);
const int MOD = 1e9 + 7;
int v[1000100];
int n, s;
long long solve1(int b, int e) {
long long ret = 0;
for (int i = b; i <= e; i++) {
if (v[i] < s) continue;
ret += v[i] - s;
}
return ret;
}
long long solve2(int b, int e) {
long long ret = 0;
for (int i = b; i <= e; i++) {
if (v[i] > s) continue;
ret += s - v[i];
}
return ret;
}
int main() {
scanf("%d %d", &n, &s);
for (int i = 0; i < n; i++) {
scanf("%d", &v[i]);
}
sort(v, v + n);
cout << solve1(0, n / 2 - 1) + solve2(n / 2 + 1, n - 1) + abs(v[n / 2] - s)
<< endl;
}
|
#include <bits/stdc++.h>
using namespace std;
long long a[200010];
int n;
long long s;
int main() {
scanf("%d%lld", &n, &s);
for (int i = 1; i <= n; i++) scanf("%lld", &a[i]);
sort(a + 1, a + n + 1);
int mid = (n + 1) / 2;
if (a[mid] > s) {
long long ans = a[mid] - s;
a[mid] = s;
for (int i = mid - 1; i >= 1; i--)
if (a[i] > a[i + 1]) {
ans += a[i] - a[i + 1];
a[i] = a[i + 1];
}
printf("%lld\n", ans);
} else if (a[mid] < s) {
long long ans = s - a[mid];
a[mid] = s;
for (int i = mid + 1; i <= n; i++)
if (a[i] < a[i - 1]) {
ans += a[i - 1] - a[i];
a[i] = a[i - 1];
}
printf("%lld\n", ans);
} else {
printf("%d\n", 0);
}
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
long long n, s, i, j, k, res = 0;
cin >> n >> s;
long long arr[n];
for (i = 0; i < n; i++) {
cin >> arr[i];
}
sort(arr, arr + n);
for (j = 0; j <= n / 2; j++) {
if (arr[j] > s) {
res = res + arr[j] - s;
}
}
for (k = n / 2; k < n; k++) {
if (arr[k] < s) {
res = res + s - arr[k];
}
}
cout << res << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
using namespace std;
int main() {
long long int n, m;
cin >> n >> m;
long long int c = 0;
std::vector<long long int> a(n);
for (int i = 0; i < n; i++) cin >> a[i];
sort(a.begin(), a.end());
if (a[n / 2] < m) {
for (int i = n / 2; i < n; ++i) {
if (a[i] < m) c += (m - a[i]);
}
cout << c;
} else if (a[n / 2] > m) {
for (int i = 0; i < n / 2 + 1; ++i) {
if (a[i] > m) c += (a[i] - m);
}
cout << c;
} else
cout << 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
long long n, second;
cin >> n >> second;
long long *a = new long long[n];
for (long long i = 0; i < n; i++) cin >> a[i];
sort(a, a + n);
long long moves = 0;
for (long long i = 0; i < n / 2; i++) {
if (a[i] > second) moves += a[i] - second;
}
for (long long i = n - 1; i > n / 2; i--) {
if (a[i] < second) moves += second - a[i];
}
moves += abs(a[n / 2] - second);
cout << moves;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, S;
cin >> n >> S;
vector<int> a(n);
for (int i = 0; i < n; i++) cin >> a[i];
long long z = LLONG_MAX;
sort(a.begin(), a.end());
long long fh = 0, sh = 0;
for (int i = 0; i < n / 2; i++) {
if (a[i] > S) fh += a[i] - S;
if (a[n - 1 - i] < S) sh += S - a[n - 1 - i];
}
cout << fh + sh + abs(a[n / 2] - S);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int N = 2e5 + 5;
long long int n, s, a[N];
long long am, um;
int main() {
cin >> n >> s;
for (int i = 1; i <= n; i++) {
cin >> a[i];
}
sort(a + 1, a + 1 + n);
for (int i = 1; i <= n / 2; i++) {
if (a[i] > s) {
um += (a[i] - s);
}
}
for (int i = (n + 1) / 2 + 1; i <= n; i++) {
if (a[i] < s) {
am += (s - a[i]);
}
}
cout << am + um + abs(a[(n + 1) / 2] - s);
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
long long n, s;
vector<long long> v;
cin >> n >> s;
for (int i = 0; i < n; i++) {
int val;
cin >> val;
v.push_back(val);
}
sort(v.begin(), v.end());
int mid = n / 2;
long long m = v[mid];
int idx = lower_bound(v.begin(), v.end(), s) - v.begin();
long long ans = 0;
int i = mid;
bool found = false;
while (i < idx) {
ans += (s - v[i]);
found = true;
i++;
}
if (!found) {
while (i >= idx) {
ans += (v[i] - s);
i--;
}
}
cout << ans << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, s;
scanf("%d %d", &n, &s);
long long arr[n];
for (int i = 0; i < n; i++) scanf("%lld", &arr[i]);
sort(arr, arr + n);
long long val = arr[n / 2];
long long cnt = abs(s - val);
for (int i = 0; i < (n / 2); i++) {
if (arr[i] > s) {
cnt += abs(arr[i] - s);
}
}
for (int i = (n / 2) + 1; i < n; i++) {
if (arr[i] < s) {
cnt += abs(arr[i] - s);
}
}
cout << cnt << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, s;
cin >> n >> s;
vector<int> v(n);
for (int i = 0; i < n; i++) {
cin >> v[i];
}
sort(v.begin(), v.end());
int med = v[n / 2];
if (med == s) {
cout << 0 << "\n";
return 0;
}
long long ans1 = 0, ans2 = 0;
for (int i = n / 2 + 1; i < n; i++) {
if (v[i] < s) {
ans1 += s - v[i];
}
}
for (int i = 0; i < n / 2; i++) {
if (v[i] > s) {
ans1 += v[i] - s;
}
}
ans1 += abs(s - v[n / 2]);
cout << ans1 << "\n";
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, s;
cin >> n >> s;
int A[n];
for (int i = 0; i < n; i++) cin >> A[i];
sort(A, A + n);
long long c = 0;
if (s > A[n / 2]) {
for (int i = n / 2; i < n; i++) {
c += max(0ll, 1ll * s - A[i]);
}
} else if (s < A[n / 2]) {
for (int i = n / 2; i >= 0; i--) {
c += max(0ll, 1ll * A[i] - s);
}
} else {
c = 0;
}
cout << c;
}
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.