# Greedy Florist

### Problem Statement :

```A group of friends want to buy a bouquet of flowers. The florist wants to maximize his number of new customers and the money he makes. To do this, he decides he'll multiply the price of each flower by the number of that customer's previously purchased flowers plus 1. The first flower will be original price, ( 0 + 1 ) * original price , the next will be  ( 1 + 1 ) * original price and so on.

Given the size of the group of friends, the number of flowers they want to purchase and the original prices of the flowers, determine the minimum cost to purchase all of the flowers.

Function Description

Complete the getMinimumCost function in the editor below. It should return the minimum cost to purchase all of the flowers.

getMinimumCost has the following parameter(s):

c: an array of integers representing the original price of each flower
k: an integer, the number of friends

Input Format

The first line contains two space-separated integers n and k, the number of flowers and the number of friends.
The second line contains n space-separated positive integers c[ i ] , the original price of each flower.

Constraints

1  <=  n. k  <= 100
1  <=  c[ i ]  <=  10^6
0   <=  i  <  n

Output Format

Print the minimum cost to buy all n flowers.```

### Solution :

```                            ```Solution in C :

In  C :

#include <stdio.h>
#include <stdlib.h>

long long a[200],i,j,k,l,m,n;

int com(const void *xx, const void *yy)
{
if(*(long long *)xx > *(long long*)yy) return -1;
return 1;
}

int main()
{

scanf("%lld %lld\n",&n,&k);
for(i=0;i<n;i++) scanf("%lld",a+i);

qsort(a,n,sizeof(a[0]),com);

m = 0;

for(i=0;i<n;i++) m+= a[i]*(1+i/k);

printf("%lld\n",m);

return 0;
}```
```

```                        ```Solution in C++ :

In  C++ :

#include <cstdio>
#include <algorithm>
using namespace std;

int a[102];

int main() {
int i,j,m,n;
long long c,ans=0;
scanf("%d%d",&n,&m);
for (i=0;i<n;++i) {
scanf("%d",&a[i]);
}
sort(a,a+n);
for (i=n-1,c=0,j=0;i>=0;--i) {
if (j==0) {
++c;
}
ans+=c*a[i];
if (++j==m) {
j=0;
}
}
printf("%Ld\n",ans);
return 0;
}```
```

```                        ```Solution in Java :

In  Java :

import java.util.Arrays;
import java.util.Scanner;

public class Solution {

public static void main(String args[]) {

Scanner in = new Scanner(System.in);

int n, k;
n = in.nextInt();
k = in.nextInt();

int c[] = new int[n];
for (int i = 0; i < n; i++) {
c[i] = in.nextInt();
}

Arrays.sort(c);

int result = 0;

if(k >= n){
for(int i=0;i<n;i++){
result +=  c[i];
}
System.out.println(result);
}else{
//Processing
int x = 0;
while(n > 0){
for(int i=0;i<k;i++){
result += c[n-1]*(x+1);
n--;
if(n == 0){
break;
}
}
x++;
}
System.out.println(result);
}
}
}```
```

```                        ```Solution in Python :

In Python3 :

NK = input()

N = int(NK.partition(' ')[0])
K = int(NK.partition(' ')[2])

prices = [int(x) for x in input().strip().split(' ')]

if K == N:
print(sum(prices))
else:
prices.sort()
friends = [[] for friend in range(K)]

for friend in friends:
friend.append(prices.pop())

index = 0
while prices:
friends[index].append(prices.pop()*(1+len(friends[index])))
index = (index + 1)%K

total = 0
for friend in friends:
total += sum(friend)

print(total)```
```

## Jim and the Skyscrapers

Jim has invented a new flying object called HZ42. HZ42 is like a broom and can only fly horizontally, independent of the environment. One day, Jim started his flight from Dubai's highest skyscraper, traveled some distance and landed on another skyscraper of same height! So much fun! But unfortunately, new skyscrapers have been built recently. Let us describe the problem in one dimensional space

## Palindromic Subsets

Consider a lowercase English alphabetic letter character denoted by c. A shift operation on some c turns it into the next letter in the alphabet. For example, and ,shift(a) = b , shift(e) = f, shift(z) = a . Given a zero-indexed string, s, of n lowercase letters, perform q queries on s where each query takes one of the following two forms: 1 i j t: All letters in the inclusive range from i t

## Counting On a Tree

Taylor loves trees, and this new challenge has him stumped! Consider a tree, t, consisting of n nodes. Each node is numbered from 1 to n, and each node i has an integer, ci, attached to it. A query on tree t takes the form w x y z. To process a query, you must print the count of ordered pairs of integers ( i , j ) such that the following four conditions are all satisfied: the path from n

## Polynomial Division

Consider a sequence, c0, c1, . . . , cn-1 , and a polynomial of degree 1 defined as Q(x ) = a * x + b. You must perform q queries on the sequence, where each query is one of the following two types: 1 i x: Replace ci with x. 2 l r: Consider the polynomial and determine whether is divisible by over the field , where . In other words, check if there exists a polynomial with integer coefficie

## Costly Intervals

Given an array, your goal is to find, for each element, the largest subarray containing it whose cost is at least k. Specifically, let A = [A1, A2, . . . , An ] be an array of length n, and let be the subarray from index l to index r. Also, Let MAX( l, r ) be the largest number in Al. . . r. Let MIN( l, r ) be the smallest number in Al . . .r . Let OR( l , r ) be the bitwise OR of the

## The Strange Function

One of the most important skills a programmer needs to learn early on is the ability to pose a problem in an abstract way. This skill is important not just for researchers but also in applied fields like software engineering and web development. You are able to solve most of a problem, except for one last subproblem, which you have posed in an abstract way as follows: Given an array consisting