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

typedef struct {
    int* times;
    int* leaders;
    int size;
} TopVotedCandidate;

int binarySearch(int* times, int size, int t) {
    int left = 0, right = size - 1;
    int result = 0;
    
    while (left <= right) {
        int mid = left + (right - left) / 2;
        if (times[mid] <= t) {
            result = mid;
            left = mid + 1;
        } else {
            right = mid - 1;
        }
    }
    return result;
}

TopVotedCandidate* topVotedCandidateCreate(int* persons, int personsSize, int* times, int timesSize) {
    TopVotedCandidate* obj = (TopVotedCandidate*)malloc(sizeof(TopVotedCandidate));
    obj->times = times;
    obj->leaders = (int*)malloc(personsSize * sizeof(int));
    obj->size = personsSize;
    
    int voteCount[1001] = {0}; // Assuming candidates <= 1000
    int leader = -1;
    
    // Precompute leader after each vote
    for (int i = 0; i < personsSize; i++) {
        int person = persons[i];
        voteCount[person]++;
        
        // Check if this person is now the leader
        if (leader == -1 || voteCount[person] >= voteCount[leader]) {
            leader = person;
        }
        
        obj->leaders[i] = leader;
    }
    
    return obj;
}

int topVotedCandidateQ(TopVotedCandidate* obj, int t) {
    int idx = binarySearch(obj->times, obj->size, t);
    return obj->leaders[idx];
}

void topVotedCandidateFree(TopVotedCandidate* obj) {
    free(obj->leaders);
    free(obj);
}