Greedy Algorithms-Greedy Florist.py

#Problem Link : https://www.hackerrank.com/challenges/greedy-florist/problem?isFullScreen=true&h_l=interview&playlist_slugs%5B%5D=interview-preparation-kit&playlist_slugs%5B%5D=greedy-algorithms

#Ans:

#!/bin/python3

import math
import os
import random
import re
import sys

def main():
    n, k = map(int, input().split())
    prices = sorted(map(int, input().split()), reverse=True)
    answer = 0

    for i in range(0, n, k):
        answer += ((i // k) + 1) * sum(prices[i:i + k])

    print(answer)


if __name__ == '__main__':
    main()