프로그래머스 42862

https://programmers.co.kr/learn/courses/30/lessons/42862#

 

 

#include <string>
#include <vector>
#include <algorithm>
using namespace std;

int solution(int n, vector<int> lost, vector<int> reserve) {
    int er = 0;
    for (int i = 0; i < lost.size(); i++) {
        for (int j = 0; j < reserve.size(); j++) {
            if (lost[i] == reserve[j] ) {
                lost[i] = -1;
                reserve[j] = -10;
                er++;
            }
        }
    }


    int answer = 0;
    int haveClothes = n - lost.size() + er;
    vector<int> rs;
    int arr[30] = { 0, };
    int cnt = 0;
    for (int i = 0; i < lost.size(); i++) {
        for (int j = 0; j < reserve.size(); j++) {
            if (lost[i] - 1 == reserve[j] && arr[reserve[j]] == 0) {
                arr[reserve[j]] = 1;
                cnt++;
                break;
            }
            else if (lost[i] + 1 == reserve[j] && arr[reserve[j]] == 0) {
                arr[reserve[j]] = 1;
                cnt++;
                break;
            }

        }
    }

    answer = cnt + haveClothes;
    return answer;
}