Pagini recente » Cod sursa (job #3297826) | Cod sursa (job #721399) | Cod sursa (job #3299148) | Cod sursa (job #2913827) | Cod sursa (job #3296113)
#include <vector>
#include <fstream>
#include <algorithm>
using namespace std;
ifstream cin("grupuri.in");
ofstream cout("grupuri.out");
int main() {
int AnimalePerGrup, NrDeGrupuri=0,n;
cin >> AnimalePerGrup>> n;
vector<int>SirDeAnimale(n);
for (int i = 0; i < n; i++) {
cin >> SirDeAnimale[i];
}
sort(SirDeAnimale.begin(), SirDeAnimale.end(),greater<int>());
int NrDeZerouri = count(SirDeAnimale.begin(), SirDeAnimale.end(), 0);
while (NrDeZerouri <= n - AnimalePerGrup) {
for (int i = 0; i<AnimalePerGrup; i++) {
SirDeAnimale[i]--;
if (SirDeAnimale[i] == 0) {
NrDeZerouri++;
}
}
NrDeGrupuri++;
sort(SirDeAnimale.begin(), SirDeAnimale.end(), greater<int>());
}
cout << NrDeGrupuri;
}