C++ 11 : create all possible k combinations of n items

#include <iostream>
#include <algorithm>
#include <vector>

main ()
{
	int nn = 5;
	int r = 3;

	std::vector<int> v_real = { 1, 2, 3, 4, 5 };

	for (int r = 1; r <= nn; r++) {
		std::vector<bool> v(nn);
		std::fill(v.begin(), v.begin() + r, true);
		do {
			for (int i = 0; i < nn; ++i) {
				if (v[i]) {
					std::cout << v_real[i] << " ";
				}
			}
			std::cout << "\n";
		} while (std::prev_permutation(v.begin(), v.end()));
	}
}