Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <iostream>
- #include <bits/stdc++.h>
- #define len 200001
- using namespace std;
- int main(){
- int n,m;
- cin >> n >> m;
- int i,j;
- int tab[len];
- for(i=0;i<n;i++){
- cin >> tab[i];
- }
- sort(tab,tab+n);
- int S[len],comp2=0,comp=0;
- for(i=0;i<n;i++){
- int L[len];
- int k=1;
- int c=0;
- int sum=0;
- for(j=0;j<i+1;j++){
- L[comp++]=k*tab[i-j];
- sum+=k*tab[i-j];
- c++;
- if(c==m){
- k++;
- c=0;
- }
- }
- S[comp2++]=sum;
- sum=0;
- }
- for(i=0;i<comp2;i++)
- cout << S[i]<< " ";
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement