Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <bits/stdc++.h>
- using namespace std;
- #include "string"
- #define int long long
- #define pi pair<int, int>
- #define ff first
- #define ss second
- #define boost ios::sync_with_stdio(false);cin.tie(nullptr)
- #define endl '\n'
- #define vivek cout << "Case #" << t << ": "
- int32_t main() {
- boost;
- int test;
- cin >> test;
- for(int t = 1; t <= test; t++){
- vivek;
- int w, n;
- cin >> w >> n;
- vector < int > a(w);
- for(int &i : a)
- cin >> i;
- sort(a.begin(), a.end());
- for(int i = 0; i < w; i++)
- a.push_back(a[i] + n);
- vector < int > pf = a;
- for(int i = 1; i < a.size(); i++)
- pf[i] += pf[i - 1];
- int ans = 1e18;
- for(int l = 0; l < w; l++) {
- int r = l + w - 1;
- int m = (l + r) / 2;
- int cur = pf[m];
- if(l > 0)
- cur -= pf[l - 1];
- cur = (m - l + 1) * a[m] - cur;
- int tt = pf[r] - pf[m];
- cur += tt - (r - m) * a[m];
- ans = min(ans, cur);
- }
- cout << ans << endl;
- }
- return 0;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement