Super Ugly Number

Write a program to find the nth super ugly number.

Super ugly numbers are positive numbers whose all prime factors are in the given prime list primes of size k. For example, [1, 2, 4, 7, 8, 13, 14, 16, 19, 26, 28, 32]is the sequence of the first 12 super ugly numbers given primes = [2, 7, 13, 19] of size 4.

Note:
(1) 1 is a super ugly number for any given primes.
(2) The given numbers in primes are in ascending order.
(3) 0 < k ≤ 100, 0 < n ≤ 106, 0 < primes[i] < 1000.

class Solution {
public:
    int nthSuperUglyNumber(int n, vector<int>& primes) {
        int size = primes.size();
	    vector<int> buf;
	    buf.push_back(1);
	    vector<int> pos(size, 0);
	    int num = 1;

	    int result = 1;
	    while (num < n)
	    {
		    result = INT_MAX;
		    for (int i = 0; i < size; i++)
		    {
			    result = min(result, primes[i] * buf[pos[i]]);
		    }

	    	for (int i = 0; i < size; i++)
		    {
			    if (primes[i]*buf[pos[i]] == result)
			    {
				    pos[i]++;
			    }
		    }
		    num++;
		    buf.push_back(result);
	    }

	    return result;
    }
};