외벽 점검 C++

https://programmers.co.kr/learn/courses/30/lessons/60062

코딩테스트 연습 - 외벽 점검

#include <string>
#include <vector>
#include <algorithm>

using namespace std;

int solution(int n, vector<int> weak, vector<int> dist) {
	int answer = 2e9;
	sort(dist.begin(), dist.end());

	for (int k = 0; k < weak.size(); k++) {
		int tmp = weak[0];
		for (int i = 0; i < weak.size() - 1; i++) {
			weak[i] = weak[i + 1];
		}
		weak[weak.size() - 1] = tmp + n;

		do {
			int index = 0;
			int cur = 0;
			for (int ii = 0; ii < weak.size() && index < dist.size(); index++) {
				cur = dist[index] + weak[ii];
				while (ii <weak.size() && cur >= weak[ii]) {
					ii++;
				}
			}
			if(cur >= weak[weak.size()-1])
				answer = min(answer, index);
		} while (next_permutation(dist.begin(), dist.end()));
	}

	if (answer == 2e9) answer = -1;
	return answer;
}