#include <iostream>
#include <vector>
#include <algorithm>
#include <set>

using namespace std;

/*
People are waiting for an elevator in a hotel. The elevator has limited capacity and you would like to analyse its movement.

The hotel has floors numbered from 0 (ground floor) to M. The elevator has a maximum capacity of X people and a weight limit of Y.
There are N people gathered at the ground floor, standing in a queue for the elevator.
You are given every person's weight
A[K]
And target floor:
B[K]

A[0] and B[0] represent the first person in the queue.
----
People continue to enter the elevator, in order of their position in the queue (and puish the buttons for their target floors) for as long as there is room for htem.

THE QUEUE ORDER CANNOT BE CHANGED

Elevetor goes up and stops at every selected floor, and finally returns to the ground floor.

This process is repeated until there are no more people in the queue. The goal is to count the total number of times that the elevator stops

E.G
M = 0-5
X = 2
Y = 200

A[0] = 60		B[0] = 2
A[1] = 80		B[1] = 3
A[2] = 40		B[2] = 5
*/

int solution(vector<int> &A, vector<int> &B, int M, int X, int Y) {
	std::set<int> floors;
	int N = A.size();
	// M number of floors from 0 - ?
	// A[i] & B[i] are the ith person on the floor,
	// X is elevator capacity, Y is the weight_limit
	int idx = 0;
	int answers = 0;
	int test = 0;
	while (idx < N) {
		int capacity = 0;
		int total_weight = 0;

		// While capacity < elevator capacity
		while (idx < N && capacity < X && (total_weight + A[idx]) <= Y) {

			total_weight = total_weight + A[idx];
			floors.insert(B[idx]);

			capacity++;
			idx++;
		}
		answers = answers + floors.size();

	}
	return answers;
}


int main(int, char* args[]) {

	vector<int> A, B;
	int X, Y, M;

	/*
	X = 5;
	Y = 200;
	A = { 60, 80, 40 };
	B = { 2, 3, 5 };
	M = 5;
	*/
	M = 3;
	X = 5;
	Y = 200;
	A = { 40, 40, 100, 80, 20 };
	B = { 3, 3, 2, 2, 3 };

	cout << solution(A, B, M, X, Y) << endl;

	system("pause");
	return 0;
}