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.  
  28.  
  29.  
  30. vector<int> a;
  31.  
  32. vector<int> consistency(int n, int k){
  33.  
  34.     int maxSum = 0;
  35.     vector<int> b;
  36.     for(int i=0; i<n; i++){
  37.         if(a[i]>=0) maxSum += a[i];
  38.         b.push_back(abs(a[i]));
  39.     }
  40.  
  41.     sort(begin(b), end(b));
  42.  
  43.  
  44.     vector<int> ans = {maxSum};
  45.  
  46.     priority_queue<pair<int,int>, vector<pair<int,int>>, greater<pair<int,int>>> pq;
  47.     pq.push({b[0], 0});
  48.  
  49.     while(!pq.empty()){
  50.         auto top = pq.top();
  51.         pq.pop();
  52.  
  53.         int sum = top.first;
  54.         int idx = top.second;
  55.  
  56.         ans.push_back(maxSum-sum);
  57.         if(ans.size() == k) break;
  58.  
  59.         if(idx+1<n){
  60.             pq.push({sum+b[idx+1], idx+1});
  61.             pq.push({sum-b[idx]+b[idx+1], idx+1});
  62.         }
  63.     }
  64.  
  65.     return ans;
  66. }
  67.  
  68.  
  69.  
  70.  
  71.  
  72.  
  73.  
  74.  
  75.  
  76.  
  77.  
  78.  
  79.  
  80.  
  81.  
  82. vector<int> practice(int n, int k){
  83.  
  84.  
  85. }
  86.  
  87.  
  88.  
  89.  
  90.  
  91. void solve() {
  92.  
  93.     int n, k;
  94.     cin>> n >> k;
  95.  
  96.     a.resize(n);
  97.     for(int i=0; i<n; i++) cin >> a[i];
  98.  
  99.     auto ans = consistency(n, k);
  100.  
  101.     for(auto& t : ans){
  102.         cout << t << " ";
  103.     }
  104.     cout << endl;
  105.  
  106.  
  107. }
  108.  
  109.  
  110.  
  111.  
  112.  
  113. int32_t main() {
  114.     ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
  115.  
  116.     int t = 1;
  117.     // cin >> t;
  118.     while (t--) {
  119.         solve();
  120.     }
  121.  
  122.     return 0;
  123. }
Success #stdin #stdout 0.01s 5320KB
comments (?)
stdin 
3 3
3 5 -2
stdout 
8 6 5
https://ideone.com/Dv1xnJ
language:
C++14 (gcc 8.3)
created:
1 day 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!