BUBT Intra University Programming Contest (Spring2020)–JuniorDivision

Apex_Legends_Beginners_Guide.c

//F. Apex Legends: Beginner's Guide
//BUBT Intra University Programming Contest (Spring2020)–JuniorDivision
//Author: Sohel Ahmed Jony 
//                  - 2021

#include <stdio.h>
#include <math.h>
#include <stdlib.h>
struct SQUAD
{
    int serial;
    int cordination_x, cordination_y;
    int h1, h2, h3;
};
struct dic_database
{
    int team_serial;
    int weakest_trash;
};

int cmpfunc(const void *a, const void *b)
{
    return (*(int *)a - *(int *)b);
}
int minimal_health(int a, int b)
{
    if (a > b)
        return b;
}
int main()
{
    struct SQUAD alpha, beta[25];
    int n, minimal_distance = (100 * 100) * 2 + (100 * 100) * 2;
    struct dic_database call_by_distance[minimal_distance];
    int minimal_distanted_team = 0;
    scanf("%d %d %d", &n, &alpha.cordination_x, &alpha.cordination_y);
    getchar();
    int distance_data[n];
    if (n > 25 || alpha.cordination_x > 101 || alpha.cordination_y > 101)
        return 0;

    for (size_t i = 0; i < n - 1; i++)
    {

        scanf("%d %d %d %d %d %d", &beta[i].serial, &beta[i].cordination_x, &beta[i].cordination_y, &beta[i].h1, &beta[i].h2, &beta[i].h3);
        getchar();
        if (beta[i].cordination_x > 101 || beta[i].cordination_y > 101)
            continue;
        distance_data[i] = ((alpha.cordination_x * beta[i].cordination_x) * 2) + ((alpha.cordination_y + beta[i].cordination_y) * 2);
    
        call_by_distance[distance_data[i]].weakest_trash = minimal_health(beta[i].h1, minimal_health(beta[i].h2, beta[i].h3));
        call_by_distance[distance_data[i]].team_serial = beta[i].serial;
    }
    qsort(distance_data, n - 1, sizeof(int), cmpfunc);

    for (size_t i = 0; i < n - 1; i++)
    {

        printf("%d %d\n", call_by_distance[distance_data[i]].team_serial, call_by_distance[distance_data[i]].weakest_trash);
    }
    return 0;
}