-
Notifications
You must be signed in to change notification settings - Fork 1
/
playlist.cpp
37 lines (35 loc) · 1.29 KB
/
playlist.cpp
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
#include <string>
#include <algorithm>
#include <iostream>
#include <vector>
#include "playlist.h"
using namespace std;
// create playlist using best-fit bin-packing algorithm, conceptualized by Jingyi Fu and fully implemented by Evelyn Colon
vector<vector<Playlist>> PlaylistGenerator::createPlaylists(const vector<pair<std::string, int>> &songs, vector<tuple<string, int, int>> tasks) {
vector<vector<Playlist>> playlists(tasks.size());
vector<int> bins;
for (int i = 0; i < tasks.size(); i++) {
bins.push_back(get<1>(tasks[i]) * 60);
}
for (const auto& song : songs) {
// Convert duration from milliseconds to seconds
int durationSeconds = song.second / 1000;
int gap = INT_MAX;
int binIndex = -1;
for (int i = 0; i < tasks.size(); i++) {
if ((bins[i] - durationSeconds < gap) && (bins[i] - durationSeconds >= 0)) {
gap = bins[i] - durationSeconds;
binIndex = i;
}
}
if (binIndex == -1) {
continue;
}
bins[binIndex] -= durationSeconds;
Playlist playlistItem;
playlistItem.songName = song.first;
playlistItem.duration = durationSeconds;
playlists[binIndex].push_back(playlistItem);
}
return playlists;
}