// Optimal SQL Query using Window Functions
/*
SELECT person_name
FROM (
    SELECT person_name, turn,
           SUM(weight) OVER(ORDER BY turn) as cumulative_weight
    FROM Queue
) t
WHERE cumulative_weight <= 1000
ORDER BY turn DESC
LIMIT 1;
*/

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

typedef struct {
    int person_id;
    char person_name[100];
    int weight;
    int turn;
} Person;

int compare_turns(const void *a, const void *b) {
    Person *pa = (Person *)a;
    Person *pb = (Person *)b;
    return pa->turn - pb->turn;
}

char* lastPersonOptimal(Person* queueData, int n) {
    // Sort by turn
    qsort(queueData, n, sizeof(Person), compare_turns);
    
    int cumulativeWeight = 0;
    static char lastValidPerson[100] = "";
    
    for (int i = 0; i < n; i++) {
        cumulativeWeight += queueData[i].weight;
        
        if (cumulativeWeight <= 1000) {
            strcpy(lastValidPerson, queueData[i].person_name);
        } else {
            break;
        }
    }
    
    return lastValidPerson;
}

// Test example
int main() {
    Person queue[] = {
        {1, "Alice", 70, 1},
        {2, "Bob", 80, 2},
        {3, "Carol", 500, 3},
        {4, "Dave", 450, 4}
    };
    printf("%s\n", lastPersonOptimal(queue, 4)); // Output: Carol
    return 0;
}