-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy path2330.cpp
47 lines (43 loc) · 1.14 KB
/
2330.cpp
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
#include <bits/stdc++.h>
using namespace std;
int main(){
long long n, l;
cin >> n >> l;
vector<long long> vendedor(n);
vector <long long> chamadas(n);
queue <long long> ligacoes;
for(long long i=0; i<l; i++){
long long a;
cin >> a;
ligacoes.push(a);
}
bool flag = true;
while(!ligacoes.empty()){
if(flag){
for(long long i=0; i<n; i++){
if(ligacoes.empty()) break;
vendedor[i] = ligacoes.front();
ligacoes.pop();
chamadas[i]++;
}
flag = false;
}
else{
for(long long i=0; ; i++){
if(i==n) i=0;
if(ligacoes.empty()) break;
if (vendedor[i]!=0){
vendedor[i]--;
}
if(vendedor[i] == 0){
vendedor[i] = ligacoes.front();
chamadas[i]++;
ligacoes.pop();
}
}
}
}
for(long long i=0; i<n; i++){
cout <<i+1<<" "<< chamadas[i] <<endl;
}
}