Hackerrank Greedy Florist Python solution

greedy_florist.py

#!/bin/python3

import math
import os
import random
import re
import sys

# Complete the getMinimumCost function below.
def getMinimumCost(k, c):
    c.sort(reverse=True)
    cost = 0
    previous_purchase = 0
    for i in range(n):
        cost += (previous_purchase +1) * c[i]
        if (i+1)%k==0:
            previous_purchase += 1
    return cost
if __name__ == '__main__':
    fptr = open(os.environ['OUTPUT_PATH'], 'w')

    nk = input().split()

    n = int(nk[0])

    k = int(nk[1])

    c = list(map(int, input().rstrip().split()))

    minimumCost = getMinimumCost(k, c)

    fptr.write(str(minimumCost) + '\n')

    fptr.close()

Can I ask why you have these two conditions if (i+1)%k==0 and (i+1)//k>0? It sort of makes sense but I would like some clarification. Sorry for the inconvenience and thank you for your time.

It is indeed needed..Try running your code without that "If" statement