#include <stdio.h>
#include <string.h>

// Max voters and candidates
#define MAX_VOTERS 100
#define MAX_CANDIDATES 9

// preferences[i][j] is jth preference for voter i
int preferences[MAX_VOTERS][MAX_CANDIDATES];

// Candidates have name, vote count, eliminated status
typedef struct
{
    string name;
    int votes;
    bool eliminated;
}
candidate;

// Array of candidates
candidate candidates[MAX_CANDIDATES];

// Numbers of voters and candidates
int voter_count;
int candidate_count;

// Function prototypes
bool vote(int voter, int rank, string name);
void tabulate(void);
bool print_winner(void);
int find_min(void);
bool is_tie(int min);
void eliminate(int min);

//int main(int argc, string argv[])
int main()
{
    int argc = 3;
    string argv = ['A', 'B', 'C'];
    // Check for invalid usage
    if (argc < 2)
    {
        printf("Usage: runoff [candidate ...]\n");
        return 1;
    }

    // Populate array of candidates
    candidate_count = argc - 1;
    if (candidate_count > MAX_CANDIDATES)
    {
        printf("Maximum number of candidates is %i\n", MAX_CANDIDATES);
        return 2;
    }
    for (int i = 0; i < candidate_count; i++)
    {
        candidates[i].name = argv[i]; //from i+1 to
        candidates[i].votes = 0;
        candidates[i].eliminated = false;
    }

    voter_count = get_int("Number of voters: ");
    if (voter_count > MAX_VOTERS)
    {
        printf("Maximum number of voters is %i\n", MAX_VOTERS);
        return 3;
    }

    // Keep querying for votes
    for (int i = 0; i < voter_count; i++)
    {

        // Query for each rank
        for (int j = 0; j < candidate_count; j++)
        {
            string name = get_string("Rank %i: ", j + 1);

            // Record vote, unless it's invalid
            if (!vote(i, j, name))
            {
                printf("Invalid vote.\n");
                return 4;
            }
        }

        printf("\n");
    }

    // Keep holding runoffs until winner exists
    while (true)
    {
        // Calculate votes given remaining candidates
        tabulate();

        // Check if election has been won
        bool won = print_winner();
        if (won)
        {
            break;
        }

        // Eliminate last-place candidates
        int min = find_min();
        bool tie = is_tie(min);

        // If tie, everyone wins
        if (tie)
        {
            for (int i = 0; i < candidate_count; i++)
            {
                if (!candidates[i].eliminated)
                {
                    printf("%s\n", candidates[i].name);
                }
            }
            break;
        }

        // Eliminate anyone with minimum number of votes
        eliminate(min);

        // Reset vote counts back to zero
        for (int i = 0; i < candidate_count; i++)
        {
            candidates[i].votes = 0;
        }
    }
    return 0;
}

// Record preference if vote is valid
bool vote(int voter, int rank, string name) // TO DO
{
  // look for a candidate called name
  for(int i = 0; i < candidate_count ; i++) 
    {
        // if candidate found
        if(strcmp(candidates[i].name, name) == 0)
        // update preferences so that they are the voter's rank preference
        {
            preferences[voter][rank]++;
            // return true
            return true;
        }
    }
 // if no candidate found return false
 return false;
}

// Tabulate votes for non-eliminated candidates
void tabulate(void) // TO DO
{
   for(int i = 0; i < voter_count ; i++)
    {
        for(int j = 0; j < candidate_count ; j++)
        {
            // if a candidate has not been eliminated yet
            if(!candidates[preferences[i][j]].eliminated)
            {
             // update vote counts for all non-eliminated candidates
             candidates[preferences[i][j]].votes++;
             break;
            }
        }
    }
        return;
  }

// Print the winner of the election, if there is one
bool print_winner(void) // TO DO
{
    float majority =(voter_count / 2.0);
    for(int i = 0; i< candidate_count ; i++)
    {
        // if any candidate has more than half of the vote  
        if((float)candidates[i].votes > majority)
        {
            // print out their name
            printf("%s\n", candidates[i].name);
            // return true
            return true;
        }
    }
    // return false if nobody won the election yet
    return false;
}

// Return the minimum number of votes any remaining candidate has
int find_min(void) // TO DO
{
    // loop through the candidates
    for(int i = 0 ; i <  candidate_count; i++)
    {
        // if the candidate is both still in the election and has the fewest number of votes
       if(!candidates[i].eliminated && candidates[i].votes < min_votes)
       {

       }
        for(int i = 0 ; i <  candidate_count; i++)
        {
            if(candidates[i].eliminated && candidates[i].votes < min_votes)
            {
                
            }
        }
    }
    // return the minimum vote total
    
}

// Return true if the election is tied between all candidates, false otherwise
bool is_tie(int min) //TO DO
{
 
    for(int i = 0 ; i < candidate_count ; i++)
    {
        if(!candidates[i].eliminated)
        {
        return false;
        }
    }
    return true;  
 }


// Eliminate the candidate (or candidates) in last place
void eliminate(int min) // TO DO
{
     for(int i = 0 ; i < candidate_count ; i++)
     {
         // if the candidate has the fewest number of votes
         if( candidates[i].votes ==  min)
         {
             // eliminate anyone still in the race who has the min number of votes
             candidates[i].eliminated = true;
         }
     }
     return;
}