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
38
39
#include <string>
#include <vector>
#include <iostream>
#include <algorithm>
using namespace std;

int solution(int n, vector<int> lost, vector<int> reserve) {
    sort(lost.begin(),lost.end());
    sort(reserve.begin(),reserve.end());
    
    int arr[41]={0};
    for(int i=0;i<lost.size();i++)
        arr[lost[i]]=-1;
    int answer = n-lost.size();
    int len=reserve.size();
    for(int i=0;i<len;i++){
        if(arr[reserve[i]]==-1){
            ++answer;
            arr[reserve[i]]=0;
            reserve.erase(reserve.begin()+i);
            --i;
            --len;
        }       
    }

    for(int i=0;i<reserve.size();i++){
        int val= reserve[i];
        if(val-1>0 && arr[val-1]==-1){
            ++answer;
            arr[val-1]=0;
        }
        else if(val+1<=30 && arr[val+1]==-1){
            ++answer;
            arr[val+1]=0;
        }
    
    }
    return answer;
}