RogerBenet

#include <cstdio>
#include <algorithm>

using namespace std;

#define MAX 100100

int vetor[MAX];
int t,n,c;

RogerBenet

#include <cstdio>
#include <string>
#include <map>

using namespace std;

#define MAX 100100

int pai[MAX], qtd[MAX], peso[MAX];
map <string, int> mapa;

RogerBenet

#include <cstdio>
#include <algorithm>

using namespace std;

#define MAXN 1100

struct func { int id; int livre; };

func atendente[MAXN];

RogerBenet

// Autor : Roger Benet >> "roger_poker99"
#include <algorithm>
#include <vector>
#include <cstdio>
#include <cstring>

typedef long long int lli;
using namespace std;

#define MAXL 25

RogerBenet

#include <cstdio>
#include <cstring>
#include <algorithm>
#define MAX 110

using namespace std;

int dp[MAX][55], qtd[MAX], peso[MAX], n, t;
bool used[MAX][55], res[MAX];

RogerBenet

#include <cstdio>
#include <algorithm>

using namespace std;

struct k
{
    int ini,fim;
};

RogerBenet

#include <cstdio>

int mdc(int x, int y){
    if( y == 0)
        return x;
    else mdc( y, x % y );
}

bool pitagoras(int x, int y, int z){
    return( x*x == y*y+z*z || y*y == x*x+z*z || z*z == x*x+y*y );

RogerBenet

#include <iostream>
#include <string>
#define MAX 20
 
using namespace std;
 
string w1,w2;
int t,c;
bool S,R;
 

RogerBenet

#include <bits/stdc++.h>
using namespace std;

typedef pair < int, string > is;
int n,c,soma[1010];
char w[20];
string txt[1010];
vector < is > vet;

int main(){

RogerBenet

#include <bits/stdc++.h>
using namespace std;

priority_queue <int, vector <int>, greater<int> > pq;
int qtd_caixa,num_caixa,num_cliente;

int main(){

    scanf("%d %d", &num_caixa, &num_cliente);