fork download
copy 
  1. #include<bits/stdc++.h>
  2. using namespace std;
  3. #define fast ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0)
  4. #define ll long long
  5. #define vll vector<ll>
  6. #define vvll vector<vll>
  7. #define FOR(i,a,b) for(ll i = a;i<b;i++)
  8. #define pll pair<ll,ll>
  9. #define pii pair<int,int>
  10. #define pb push_back
  11. #define Ye cout<<"YES\n"
  12. #define No cout<<"NO\n";
  13. #define pq priority_queue<ll>
  14. void in(ll n, ll a[]){
  15.     for(int i = 1;i<=n;i++){
  16.         cin >> a[i];
  17.     }
  18. }
  19. void out(int n, int a[]){
  20.     for(int i = 0;i<n;i++){
  21.         cout << a[i] << " ";
  22.     }
  23. }
  24. const int maxn = 2e5+5;
  25. ll n,k;
  26. ll d[maxn];
  27. ll u = 1;
  28. ll v = 0;
  29. ll f(ll u, ll x){
  30.     return max(n - (x-u+1)*(k+1)+1,1LL);
  31. }
  32. void solve(){
  33.     cin >> n >> k;
  34.     ll x = n/(k+1);
  35.     u = 1;
  36.     v = f(u,x);
  37.     in(n,d);
  38.     pq p;
  39.     ll ans = 0;
  40.     FOR(i,0,n){
  41.         p.push(d[i]);
  42.         if(i == v){
  43.             ans+=p.top();
  44.             p.pop();
  45.             if(u < x){
  46.                 u++;
  47.                 v = f(u,x);
  48.             }
  49.         }
  50.     }
  51.     cout << ans << "\n";
  52. }
  53.  
  54. signed main(){
  55.     fast;
  56.     int t = 1; cin >> t;
  57.     while(t--)solve();
  58. }
Success #stdin #stdout 0s 5320KB
comments (?)
stdin
copy 
Standard input is empty
stdout
copy 
0
https://ideone.com/362sgM
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!