[3] 최고의 집합

#include <string>
#include <vector>

using namespace std;

vector<int> solution(int n, int s) 
{
    vector<int> answer;
    
    if (n > s)
        answer.push_back(-1);
    
    else
    {
        int d=s/n, r=s%n;
        answer.assign(n, d);
        
        for (int i = answer.size() - 1; i >= 0 && r > 0; i--)
        {
            answer[i]++;
            r--;
        }
    }    
    return answer;
}