[c++] 최고의 집합

#include <string>
#include <vector>
#include <algorithm>
using namespace std;
 
 
vector<int> solution(int n, int s) {    
    vector<int> answer;
    int quot=s/n;
    int rem=s%n;
    if(n>s){
        answer.push_back(-1);
        return answer;
    }
    for(int i=0;i<n;i++)
        answer.push_back(quot);
    int pos=0;
    while(rem){
        if(pos==n)
            pos=0;
        answer[pos++]+=1;
        rem--;
    }
    sort(answer.begin(),answer.end());
    return answer;
}
 
 

출처: https://school.programmers.co.kr/learn/courses/30/lessons/12938