1253C. Sweets Eating - Codeforces Solution C++

➤  Problem Link : 1253C. Sweets Eating 

✅ C++ Solution :

 
#include<bits/stdc++.h>
using namespace std;

#define ll long long int

int main()
{
	ll n,m;
	cin>>n>>m;
	ll arr[n+1];
	ll cum[n+1];
	cum[0]=0;
	arr[0]=-1;
	
	for(ll i=1;i<=n;i++)
	{
		cin>>arr[i];
		
	}
	sort(arr,arr+n+1);
    for(ll i=1;i<=n;i++)
		cum[i]=arr[i]+cum[i-1];

	ll ans[n+1];
	ans[0]=0;
	for(ll i=1;i<=n;i++)
	{
	    if(i>m)
            ans[i]=cum[i]-cum[i-m]+ans[i-m]+cum[i-m];
        else
            ans[i]=cum[i];
		cout<<ans[i]<<" ";
	}


}

 

Thank you for your patience reading. If you enjoyed this post, I’d be very grateful if you’d help it spread by emailing it to a friend, or sharing it on Whatsapp or Facebook. 

😇Happy Learning!!

• Tweet
• Share
• Share
• Share
• Share

About Utkarsh Gupta

I am a Member Technical at D.E. Shaw India Pvt. Ltd. CodingWithArt is a blog where you find tricks and solutions to challenging coding and development problems. I aim to build a universal tech platform for every enthusiast out there.