컨베이어 벨트 위의 로봇 C++

https://www.acmicpc.net/problem/20055

20055번: 컨베이어 벨트 위의 로봇

#include <iostream>
#include <vector>

using namespace std;

int n, k;
vector<pair<int, int>> robot;

int CheckZero() {
	int answer = 0;

	for (int i = 0; i < robot.size(); i++) {
		if (robot[i].first == 0)
			answer++;
	}

	return answer;
}

void RotateBelt() {
	pair<int,int> temp = robot[robot.size() - 1];

	for (int i = robot.size() - 2; i >= 0; i--) robot[i + 1].first = robot[i].first;

	for (int i = n - 2; i >= 0; i--) robot[i + 1].second = robot[i].second;

	robot[0].first = temp.first;
	robot[0].second = 0;
}

void MoveRb() {
	for (int i = n-1; i >=0 ; i--) {

		if (robot[i].second == 1) {
			if (i == n - 1) {
				robot[i].second = 0;
			}
			else {
				if (robot[i + 1].first > 0 && robot[i + 1].second == 0) {
					robot[i + 1].second = 1;
					robot[i].second = 0;
					robot[i + 1].first -= 1;
				}
			}
		}
	}
}

void UpRb() {
	if (robot[0].first > 0 && robot[0].second == 0) {
		robot[0].second += 1;
		robot[0].first -= 1;
	}
}

int main(void) {
	int temp, answer = 0;
	cin >> n >> k;

	for (int i = 0; i < 2 * n; i++) {
		cin >> temp;
		robot.push_back(make_pair(temp, 0));
	}

	while (CheckZero() < k) {
		RotateBelt();
		MoveRb();
		UpRb();
		answer++;
	}
	cout << answer;
	return 0;
}