1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
#include <string>
#include <vector>
#include <algorithm>
using namespace std;

vector<int> solution(vector<int> arr, int divisor) {
    vector<int> answer;
    int i, alen =(int)arr.size();
    for(i=0;i<alen;i++){
        if(arr[i]%divisor == 0)
            answer.push_back(arr[i]);
    }
    
    if(answer.size() == 0)
        answer.push_back(-1);
    else
        sort(answer.begin(),answer.end());
    
    return answer;
}