[2581] 소수

#include <iostream>
#include <vector>
using namespace std;
int main()
{
	vector<int> suso;
	int num1, num2, sum = 0;
	int i, j;
	cin >> num1;
	cin >> num2;
		
	for (i = num1; i <= num2; i++)
	{
		int susocnt = 0;
		if (i > 1)
		{
			for (j = 1; j <= i; j++)
			{
				if (i % j == 0)
					susocnt++;
			}
		}
		if (susocnt == 2)
			suso.push_back(i);
	}
	for (i = 0; i < suso.size(); i++)
	{
		sum += suso[i];
	}
	if (sum == 0)
	{
		cout << "-1\n";
		return 0;
	}
	cout << sum << "\n" << suso.at(0) << "\n";
	return 0;
}