// editor1
#include<stdio.h>
#include<stdlib.h>
#define MAX 100
struct task{
    int taskid;
    int Priority;
};
struct task heap[MAX];
int size=0;
void swap(struct task*a,struct task*b)
{
    struct task temp=*a;
    *a=*b;
    *b=temp;
    
}
void heapifyup(int index)
{
    if(index<=0)
    return;
    int parent=(index-1)/2;
    if(heap[index].Priority<heap[parent].Priority)
    {
        swap(&heap[index],&heap[parent]);
        heapifyup(parent);
        
    }
}
void insert(int taskid,int priority)
{
    heap[size].taskid=taskid;
    heap[size].Priority=priority;
    scanf("%d%d",&taskid,&priority);
    if(taskid<0||priority<0)
    {
        printf("Invalid input\n");
        continue;
    }
    insert(taskid,Priority);
    
    
}
printf("Task with Highest Priority: %d\n",heap[0].taskid);
return 0;}