1014 Waiting in Line （30 分)

该题细节特别多，注意如果轮到某人的话

#include <bits/stdc++.h>
using namespace std;
const int M = 1e3 + 10;
int n,m,k,q,per;
int cost[M];
int out[M],in[M];
queue<int> dl[21];
void Init(int k){
    for(int i = 1; i <= k; ++i)in[i] = 0;
    for(int i = 1; i <= k; ++i){
        cin >> cost[i];
        int minp = 0;
        for(int j = 0; j < n; ++j)
            if(dl[j].size() < dl[minp].size()) minp = j;
        if(dl[minp].size() < m){
            dl[minp].push(i);
        }
        out[i] = -1;
    }

}

int main(){
    //freopen("1.txt","r",stdin);
    cin >> n >> m >> k >> q;
    Init(k);
    int total = 0;
    int start = n*m+1;
    while(total < 540){
        total++;
        for(int i = 0; i < n; ++i){
            if(dl[i].size() == 0) continue;
            else{