Pagini recente » Cod sursa (job #2900502) | Cod sursa (job #1768290) | Cod sursa (job #3138735) | Cod sursa (job #2705305) | Cod sursa (job #3132035)
#include <iostream>
#include <fstream>
#include <vector>
#include <algorithm>
using namespace std;
vector<int> gaseste_finale(int N, int S, const vector<int>& num_loterie) {
vector<int> sortate = num_loterie;
sort(sortate.begin(), sortate.end());
vector<int> num_selectate;
int suma_curenta = 0;
size_t start = 0;
while (num_selectate.size() < 6 && start < sortate.size()) {
int numar_curent = sortate[start];
if (suma_curenta + numar_curent <= S) {
num_selectate.push_back(numar_curent);
suma_curenta += numar_curent;
}
start++;
}
if (num_selectate.size() == 6 && suma_curenta == S) {
return num_selectate;
} else {
return vector<int>{-1};
}
}
int main() {
int N, S;
vector<int> num_loterie;
// CITIREA
ifstream input("loto.in");
input >> N >> S;
for (int i = 0; i < N; i++) {
int num;
input >> num;
num_loterie.push_back(num);
}
input.close();
// CALCULARE NUMERE CASTIGATOARE
vector<int> castigator = gaseste_finale(N, S, num_loterie);
// AFISARE
ofstream output("loto.out");
if (castigator[0] == -1) {
output << "-1" << endl;
} else {
for (size_t i = 0; i < castigator.size(); i++) {
output << castigator[i] << " ";
}
output << endl;
}
output.close();
return 0;
}