[레벨1] 나누어 떨어지는 숫자 배열

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

using namespace std;

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