fork download
copy 
  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.  
  28.  
  29.  
  30. vector<int> a;
  31. vector<int> b;
  32.  
  33. int consistency(int n, int k1, int k2){
  34.  
  35.     priority_queue<int> pq;
  36.     for(int i=0; i<n; i++){
  37.         pq.push(abs(a[i]-b[i]));
  38.     }
  39.  
  40.     int k = k1+k2;
  41.     for(int i=1; i<=k; i++){
  42.         auto diff = pq.top(); pq.pop();
  43.         pq.push(abs(diff-1));
  44.     }
  45.  
  46.     int ans = 0;
  47.     while(!pq.empty()){
  48.         auto top = pq.top(); pq.pop();
  49.         ans += (top*top);
  50.     }
  51.  
  52.     return ans;
  53.  
  54. }
  55.  
  56.  
  57.  
  58.  
  59.  
  60.  
  61.  
  62.  
  63.  
  64.  
  65.  
  66.  
  67.  
  68.  
  69.  
  70. int practice(int n, int k1, int k2){
  71.  
  72.  
  73.     return 0;
  74. }
  75.  
  76.  
  77.  
  78.  
  79.  
  80. void solve() {
  81.  
  82.     int n, k1, k2;
  83.     cin>> n >> k1 >> k2;
  84.  
  85.     a.resize(n);
  86.     for(int i=0; i<n; i++) cin >> a[i];
  87.     b.resize(n);
  88.     for(int i=0; i<n; i++) cin >> b[i];
  89.  
  90.     cout << consistency(n, k1, k2) << endl;
  91.  
  92.  
  93. }
  94.  
  95.  
  96.  
  97.  
  98.  
  99. int32_t main() {
  100.     ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
  101.  
  102.     int t = 1;
  103.     // cin >> t;
  104.     while (t--) {
  105.         solve();
  106.     }
  107.  
  108.     return 0;
  109. }
Success #stdin #stdout 0s 5324KB
comments (?)
stdin
copy 
8 20 25
4 1 2 5 8 3 7 3
4 2 20 7 9 10 7 21
stdout
copy 
2
https://ideone.com/hlBpsq
language:
C++14 (gcc 8.3)
created:
4 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!