#include <iostream>
#include "queue.h"
#include <iomanip>
using namespace std;
 
int get_lowest(Queue [], int);
 
int main()
{
        int qs_pair = 10, maxtran, prob, dur, seed;
        int count(0);                    // The number of customers served
        int entry_time(0);               // When each served customer arrived
        int wait_sum(0);                 // Sum of waiting times
        int server_count(0);             // count the server;
 
        cout << "how many queue/server pair(s)? ";
        cin >> qs_pair;
        cout << "\nthe max time for customer transaction --> ";
        cin >> maxtran;
        cout << "\nthe probability a customer will arrive --> ";
        cin >> prob;
        cout << "\nduration of simulation(at least 1) --> ";
        cin >> dur;
        cout << "\nduration of simulation(at least 1) --> ";
        cin >> dur;
        cout << "\nenter an integer seed --> ";
        cin >> seed;
 
        srand(seed);
        Queue line[qs_pair];
        int trans_time[qs_pair]; //time remaining in a transaction
 
        for(int i = 0; i < qs_pair; i++)
        {
                trans_time[i] = 0;
        }
 
        int lowest;
        int trans_time_c; // trans_time counter
 
        for(int time = 0; time < dur; time++)
        {
                if(rand() % 100 < prob)
                {
                        lowest = get_lowest(line, qs_pair);
 
                        lowest = get_lowest(line, qs_pair);
 
                        line[lowest].enqueue(time);
                }
 
                //good above
 
                for(trans_time_c; trans_time_c < qs_pair; trans_time_c++)
                {
                        if(trans_time[trans_time_c] == 0)
                        {
                                if(line[trans_time_c].return_index() != 0)
                                {
                                        entry_time = line[trans_time_c].dequeue();
                                        wait_sum += (time - entry_time);
                                        ++count;
                                        trans_time[trans_time_c] = (rand() % maxtran) + 1;
                                }
                        }
                        else
                        {
                                trans_time[trans_time_c] -= 1;
                        }
 
                }
        }
 
 
}
 
int get_lowest(Queue line[], int qs_pair)
{
        int temp = line[0].return_index();
        int temp_i = 0;
 
        for(int i = 0; i < qs_pair; i++)
        {
                if(line[i].return_index() == 0)
                        return i;
                else if((i == qs_pair - 1) && line[qs_pair - 1].return_index() < temp)
                {
                        temp = line[qs_pair - 1].return_index();
                        temp_i = qs_pair - 1;
                }
                else
				{
 
                        if(line[i].return_index() > temp)
                        {
 
                        }
                        else
                        {
                                temp = line[i].return_index();
                                temp_i = i;
                        }
                }
        }
        return temp_i;
}