fork download 
  1. #include <bits/stdc++.h>
  2. using namespace std;
  3. #define int              long long int
  4. #define double           long double
  5. #define print(a)         for(auto x : a) cout << x << " "; cout << endl
  6.  
  7.  
  8. const int M = 1000000007;
  9. const int N = 3e5+9;
  10. const int INF = 2e9+1;
  11. const int LINF = 2000000000000000001;
  12.  
  13. inline int power(int a, int b, int mod=M) {
  14.     int x = 1;
  15.     a %= mod;
  16.     while (b) {
  17.         if (b & 1) x = (x * a) % mod; 
  18.         a = (a * a) % mod;
  19.         b >>= 1;
  20.     }
  21.     return x;
  22. }
  23.  
  24.  
  25. //_ ***************************** START Below *******************************
  26.  
  27. // 7 4
  28. // 8 1 4 6 1 5 11
  29.  
  30.  
  31. vector<int> a;
  32.  
  33. int consistency(int n, int k){
  34.  
  35. 	sort(begin(a), end(a));
  36.  
  37. 	vector<int> prefix(n+1);
  38. 	for(int i=0; i<n; i++ ){
  39. 		prefix[i+1] = prefix[i] + a[i];
  40. 	}
  41.  
  42. 	vector<int> sufix(n+1);
  43. 	for(int i=n-1; i>=0; i--){
  44. 		sufix[i] = sufix[i+1] + a[i];
  45. 	}
  46.  
  47. 	int ans = INF;
  48.  
  49. 	for(int i=k-1; i<n; i++){
  50. 		int j = i-k+1;
  51. 		int m1 = j + (k-1)/2;
  52. 		int m2 = m1+1;
  53.  
  54. 		if(k&1){
  55. 			int leftSum = prefix[m1+1]-prefix[j];
  56. 			int rightSum = sufix[m1+1] - sufix[i+1];
  57.  
  58. 			ans = min(ans, a[m1] - leftSum + rightSum);
  59. 		}
  60. 		else{
  61. 			int leftSum = prefix[m1+1]-prefix[j];
  62. 			int rightSum = sufix[m1+1] - sufix[i+1];
  63.  
  64. 			ans = min(ans,  -leftSum + rightSum);
  65.  
  66.  
  67. 			leftSum = prefix[m2+1] - prefix[j];
  68. 			rightSum = sufix[m2+1] - sufix[i+1];
  69.  
  70. 			ans = min(ans, 2*a[m2] - leftSum + rightSum);
  71. 		}
  72.  
  73. 	}
  74.  
  75. 	return ans;
  76. }
  77.  
  78.  
  79.  
  80.  
  81.  
  82.  
  83.  
  84.  
  85.  
  86.  
  87.  
  88.  
  89.  
  90.  
  91.  
  92. int practice(int n, int k){
  93.  
  94.  
  95.     return 0;
  96. }
  97.  
  98.  
  99.  
  100.  
  101.  
  102. void solve() {
  103.  
  104.     int n, k;
  105.     cin>> n >> k;
  106.  
  107.     a.resize(n);
  108.     for(int i=0; i<n; i++) cin >> a[i];
  109.  
  110.     cout << consistency(n, k) << endl;
  111.  
  112.  
  113. }
  114.  
  115.  
  116.  
  117.  
  118.  
  119. int32_t main() {
  120.     ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
  121.  
  122.     int t = 1;
  123.     // cin >> t;
  124.     while (t--) {
  125.         solve();
  126.     }
  127.  
  128.     return 0;
  129. }
Success #stdin #stdout 0s 5320KB
comments (?)
stdin 
7 4
8 1 4 6 1 5 11
stdout 
5
https://ideone.com/f1rsja
language:
C++14 (gcc 8.3)
created:
2 hours ago
visibility:
public

Share or Embed source code

Discover > Sphere Engine API

The brand new service which powers Ideone!

Discover > IDE Widget

Widget for compiling and running the source code in a web browser!