SudhagarS

line1=raw_input().split()
N,K,total,completed,Costs=int(line1[0]),int(line1[1]),0,0,[]
for n in raw_input().split():Costs.append(int(n))
Costs.sort(reverse=True)	
friend=[0]*K
for i in range(N):
	friend[completed%K]+=1
	total=total+friend[completed%K]*Costs[i]
	completed+=1
print total

SudhagarS

def reduce(s):
    global value, minimum
    l = len(s)
    minimum = l
    if l == 1:
        value = 1
        return True
    elif l == 2 and s[0] == s[1]:
        value = 2
        return True

SudhagarS

from math import sqrt
N = int(raw_input())
x, y = [], []
y = []
for i in xrange(N):
    temp = raw_input().split()
    x.append(int(temp[0]))
    y.append(int(temp[1]))
avg_x = sum(x) / N
avg_y = sum(y) / N

SudhagarS

N, R = int(raw_input()), []
V = [1] * N
for x in xrange(N):
    R.append(int(raw_input()))
while True:
    finished = True
    for i in xrange(N):
        for k in [-1, 1]:
            next = i + k
            if next >= 0 and next < N and R[next] > R[i] and V[next] <= V[i]:

SudhagarS

class StrSimilar{
	public static void main(String[] args) {
		java.util.Scanner sc=new java.util.Scanner(System.in);
		int N=sc.nextInt(),sol;
		while(N--!=0){
			sol=0;
			char[] s=sc.next().toCharArray();
			for(int i=0;i<s.length;i++){
				for(int j=i;j<s.length;j++){
					if(s[j]==s[j-i]) sol++;

SudhagarS

import java.util.*;

public class EvenTree {
	public static void main(String args[]){
		Scanner s=new Scanner(System.in);
		int n,m;
		int e1,e2;
		n=s.nextInt();
		m=s.nextInt();
		Tree t=new Tree(n);

SudhagarS

/*
ID: sudhaga1
PROG: beads
LANG: C++
*/
#include "iostream"
#include "fstream"
using namespace std;
    	
int main()

SudhagarS

/*
ID: sudhaga1
PROG: milk
LANG: C++
*/
#include <iostream>
#include <fstream>
#include <string>
using namespace std;
#define MAXCOSTS 1001

SudhagarS

#include <iostream>
#include <stdio.h>
#include <string.h>
using namespace std ;
#define _(x,a) memset(x,a,sizeof(x))
#define LET(x,a) __typeof(a) x(a)
#define FOR(i,a,b) for(LET(i,a);i!=(b);++i)
#define REP(i,n) FOR(i,0,n)
#define GI ({int t;scanf("%d",&t);t;})

SudhagarS

import java.io.*;
import java.util.*;
public class Schedule {
	public static void main(String args[]) throws IOException{
		BufferedReader br=new BufferedReader(new InputStreamReader(System.in));
		StringTokenizer st=new StringTokenizer(br.readLine());
		boolean m[]=new boolean[1441];m[1440]=false;
		int n=Integer.parseInt(st.nextToken());int meeting_time=Integer.parseInt(st.nextToken()),shh,smm,ehh,emm,ashh=0,asmm=0,aehh=0,aemm=0;
		while(n--!=0){
			st=new StringTokenizer(br.readLine());