-
Notifications
You must be signed in to change notification settings - Fork 77
/
GreedyFlorist.js
63 lines (43 loc) · 1.44 KB
/
GreedyFlorist.js
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
'use strict';
const fs = require('fs');
process.stdin.resume();
process.stdin.setEncoding('utf-8');
let inputString = '';
let currentLine = 0;
process.stdin.on('data', inputStdin => {
inputString += inputStdin;
});
process.stdin.on('end', function() {
inputString = inputString.replace(/\s*$/, '')
.split('\n')
.map(str => str.replace(/\s*$/, ''));
main();
});
function readLine() {
return inputString[currentLine++];
}
// Complete the getMinimumCost function below.
function getMinimumCost(k, c) {
// Create a 2D array holding purchase order for each friend
let purchases = new Array(k).fill(0).map(x => [])
// Sort flowers from most expensive to cheapest
c.sort((a,b) => b-a)
// Distribute purchases evenly between friends
for (let i = 0, l = c.length; i < l; i++) purchases[i%k].push(c[i])
// Calculate and return sum of all purchases
return purchases.reduce( (total_cost, friend_total) => {
return total_cost + friend_total.reduce( (total, cost, i) => {
return total + (i + 1) * cost
}, 0)
}, 0)
}
function main() {
const ws = fs.createWriteStream(process.env.OUTPUT_PATH);
const nk = readLine().split(' ');
const n = parseInt(nk[0], 10);
const k = parseInt(nk[1], 10);
const c = readLine().split(' ').map(cTemp => parseInt(cTemp, 10));
const minimumCost = getMinimumCost(k, c);
ws.write(minimumCost + '\n');
ws.end();
}