Question

C programming question

please meet all of the following conditions don't just output the same answer

​​​​​​​

Given a sequence a. The elements of a has the following infomations: index The index is followed by the input order, starts from 1. The input won't contain index , you have to record it yourself. Smaller input index has higher priority. admin level : Level starts from 0 to 999. level 0 has the highest priority, while level 999 has the lowest. president Heng f of differe Heeheng level school affairs level 1 level 2 junior sister( ) level 3senior sister() level 4 senior brother( ) level 5 campus stray dogs/cats level 6squirrel level 7 pigeon level 999 junior brother() license number An integer. Smaller number has higher priority. You are going to sort a. Element with higher priority brings to the front. Compare admin level first, then license number, then index Output index (the old one) of every element the new a . Input The first line contains an integer n, indicates the number of elements in a There are n lines below. Start from the first line of the n lines, the i-th line contains the i-th information. Each line contains 2 integers admin level and license number. n

Answer 1

Here is the required program

I've used insertion sort for sorting

#include<stdio.h>
struct sequence{ //structure for storing a sequence together
   int index;
   int admin_level;
   int license_no;
};
int main()
{
   int a;
   scanf("%d",&a); //input of no. of lines
   struct sequence ar[a+1];
   struct sequence temp;
   for(int i=1;i<=a;i++)
   {
       ar[i].index=i; //generate index no.
       scanf("%d%d",&ar[i].admin_level,&ar[i].license_no);
   }
   for(int i=2;i<=a;i++) //use insertion sort
   {
       for(int j=i;j>1;j--)
       {
           if(ar[j].admin_level<ar[j-1].admin_level)
           {
               temp=ar[j];
               ar[j]=ar[j-1];
               ar[j-1]=temp;
           }
           else if(ar[j].admin_level==ar[j-1].admin_level )
           {
               if(ar[j].license_no<ar[j-1].license_no){
               temp=ar[j];
               ar[j]=ar[j-1];
               ar[j-1]=temp;
           }

           else if(ar[j].license_no==ar[j-1].license_no)
           {
               if(ar[j].index<ar[j].index)
               {
                   temp=ar[j];
               ar[j]=ar[j-1];
               ar[j-1]=temp;
               }
               else
               {
                   break;
               }
           }
           else
           {
               break;
           }
           }
           else
               break;
       }
   }

   printf("%d", ar[1]);;
   for(int i=2;i<=a;i++) //loop for printing out the result
       printf(" %d",ar[i].index);
   printf("\n");
}

here is the ss of the output

PS D:\mingw-w64\i686-8.1.0-posix-dwarf-rt_v6-rev0\mingw32\bin> ./a.ex 5 6 60 1 20 999 100000000 1 40 0 20 5 2 4 1 3 PS D:\mingw-w64\1686-8.1.0-posix-dwarf-rt_v6-rev0\mingw32\bin>

I hope this will help you so please give positive ratings :)))