Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <stdio.h>
- int main(void) {
- int nVendedores, nLigac, i, j, k;
- scanf("%d %d", &nVendedores, &nLigac);
- int Inativo[nVendedores], Atendidas[nVendedores], Ligacoes[nLigac];
- for(i = 0; i < nLigac; i++)
- scanf("%d", &Ligacoes[i]);
- for(i = 0; i < nVendedores; i++) {
- Inativo[i] = 0;
- Atendidas[i] = 0;
- }
- for(i = 0; i < nLigac; i++) {
- int FORCE_BREAK = 0;
- if(Ligacoes[i] == -1)
- continue;
- for(k = 0; k < nVendedores; k++) {
- if(Atendidas[k] == 0) {
- Inativo[k] = Ligacoes[i];
- Atendidas[k]++;
- Ligacoes[i] = -1;
- FORCE_BREAK = 1;
- break;
- }
- }
- if(FORCE_BREAK)
- continue;
- for(j = 0; j < nVendedores; j++) {
- if(--Inativo[j] > 0)
- continue;
- else {
- if(Ligacoes[i] == -1)
- i++;
- }
- if(Ligacoes[i] != -1 && i != nLigac) {
- Inativo[j] = Ligacoes[i];
- Atendidas[j]++;
- Ligacoes[i] = -1;
- }
- }
- if(Ligacoes[i] != -1)
- i--;
- }
- for(i = 0; i < nVendedores; i++)
- printf("%d %d\n", i+1, Atendidas[i]);
- return 0;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement