백준 2581 C++ 소수찾기

#include <bits/stdc++.h>
using namespace std;
bool flag = true;
bool sosu(int n) {
	if (n < 2)
		return false;
	for (int i = 2; i <= sqrt(n); i++) {
		if (n % i == 0)
			return false;
	}
	return true;
}
int main() {
	cin.tie(0)->sync_with_stdio(0);
	int a, b,sma=-1,hap=0,cnt=0;
	cin >> a >> b;
	for (int i = a; i <= b; i++) {
		if (sosu(i)) {
			hap += i;
			if (sma == -1)
				sma = i;
		}
	}
	
	if (sma == -1) 
		cout << -1 << "\n";

	
	else 
		cout << hap << "\n" << sma << "\n";
	
	return 0;
}