#include

#include

#include

#include

#include

$//$ Define the Record structure

struct Record $\{$

char rail;

uint$8\_$t club;

char truck$[11]$;

uint$16\_$t riddle;

int$64\_$t crow;

uint$16\_$t heat;

bool toy;

uint$16\_$t volcano;

uint$16\_$t achiever;

int$8\_$t shoes;

uint$16\_$t creator;

bool crime;

double feeling;

float idea;

uint$32\_$t cherries;

double beds;

$\}$;

$//$ Comparison function for sorting records

int compare$\_$records$($const void$*$ a$,$ const void$*$ b$)\{$

const struct Record$*$ r$1=($const struct Record$*)$a;

const struct Record$*$ r$2=($const struct Record$*)$b;

if $($r$1->$beds $!=$ r$2->$beds$)$

return $($r$1->$beds $>$ r$2->$beds$)-($r$1->$beds $<$ r$2->$beds$)$;

if $($r$1->$cherries $!=$ r$2->$cherries$)$

return $($r$2->$cherries $>$ r$1->$cherries$)-($r$2->$cherries $<$ r$1->$cherries$)$;

if $($r$1->$rail $!=$ r$2->$rail$)$

return $($r$2->$rail $>$ r$1->$rail$)-($r$2->$rail $<$ r$1->$rail$)$;

if $($r$1->$feeling $!=$ r$2->$feeling$)$

return $($r$2->$feeling $>$ r$1->$feeling$)-($r$2->$feeling $<$ r$1->$feeling$)$;

if $($r$1->$crow $!=$ r$2->$crow$)$

return $($r$1->$crow $>$ r$2->$crow$)-($r$1->$crow $<$ r$2->$crow$)$;

if $($r$1->$heat $!=$ r$2->$heat$)$

return $($r$2->$heat $>$ r$1->$heat$)-($r$2->$heat $<$ r$1->$heat$)$;

if $($r$1->$riddle $!=$ r$2->$riddle$)$

return $($r$2->$riddle $>$ r$1->$riddle$)-($r$2->$riddle $<$ r$1->$riddle$)$;

int truck$\_$cmp $=$ strcmp$($r$1->$truck, r$2->$truck$)$;

if $($truck$\_$cmp $!=0)$

return truck$\_$cmp;

if $($r$1->$volcano $!=$ r$2->$volcano$)$

return $($r$2->$volcano $>$ r$1->$volcano$)-($r$2->$volcano $<$ r$1->$volcano$)$;

if $($r$1->$achiever $!=$ r$2->$achiever$)$

return $($r$1->$achiever $>$ r$2->$achiever$)-($r$1->$achiever $<$ r$2->$achiever$)$;

if $($r$1->$toy $!=$ r$2->$toy$)$

return $($r$1->$toy $>$ r$2->$toy$)-($r$1->$toy $<$ r$2->$toy$)$;

if $($r$1->$crime $!=$ r$2->$crime$)$

return $($r$2->$crime $>$ r$1->$crime$)-($r$2->$crime $<$ r$1->$crime$)$;

if $($r$1->$idea $!=$ r$2->$idea$)$

return $($r$2->$idea $>$ r$1->$idea$)-($r$2->$idea $<$ r$1->$idea$)$;

if $($r$1->$club $!=$ r$2->$club$)$

return $($r$2->$club $>$ r$1->$club$)-($r$2->$club $<$ r$1->$club$)$;

if $($r$1->$shoes $!=$ r$2->$shoes$)$

return $($r$1->$shoes $>$ r$2->$shoes$)-($r$1->$shoes $<$ r$2->$shoes$)$;

if $($r$1->$creator $!=$ r$2->$creator$)$

return $($r$2->$creator $>$ r$1->$creator$)-($r$2->$creator $<$ r$1->$creator$)$;

return $0$;

$\}$

int main$($int argc, char$**$ argv$)\{$

if $($argc $!=3)\{$

fprintf$($stderr$,$ "Usage: $\%$s

$",$ argv$[0])$;

return EXIT$\_$FAILURE;

$\}$

FILE$*$ input$\_$file $=$ fopen$($argv$[1],"$rb$")$;

if $(!$input$\_$file$)\{$

fprintf$($stderr$,$ "Error: Could not open input file $\text{'}\%$s$\text{'}$

$",$ argv$[1])$;

return EXIT$\_$FAILURE;

$\}$

fseek$($input$\_$file, $0,$ SEEK$\_$END$)$;

long file$\_$size $=$ ftell$($input$\_$file$)$;

rewind$($input$\_$file$)$;

if $($file$\_$size $\%$ sizeof$($struct Record$)!=0)\{$

fprintf$($stderr$,$ "Error: File size is not a multiple of record size

$")$;

fclose$($input$\_$file$)$;

return EXIT$\_$FAILURE;

$\}$

size$\_$t num$\_$records $=$ file$\_$size $/$ sizeof$($struct Record$)$;

struct Record$*$ records $=($struct Record$*)$malloc$($num$\_$records $*$ sizeof$($struct Record$))$;

if $(!$records$)\{$

fprintf$($stderr$,$ "Error: Memory allocation failed

$")$;

fclose$($input$\_$file$)$;

return EXIT$\_$FAILURE;

$\}$

for $($size$\_$t i $=0$; i $<$ num$\_$records; i$++)\{$

fread$($&records$[$i$].$rail, sizeof$($char$),1,$ input$\_$file$)$;

fread$($&records$[$i$].$club, sizeof$($uint$8\_$t$),1,$ input$\_$file$)$;

fread$($records$[$i$].$truck, sizeof$($char$),10,$ input$\_$file$)$;

records$[$i$].$truck$[10]=\text{'}\backslash 0\text{'}$;

fread$($&records$[$i$].$riddle, sizeof$($uint$16\_$t$),1,$ input$\_$file$)$;

fread$($&records$[$i$].$crow, sizeof$($int$64\_$t$),1,$ input$\_$file$)$;

fread$($&records$[$i$].$heat, sizeof$($uint$16\_$t$),1,$ input$\_$file$)$;

fread$($&records$[$i$].$toy, sizeof$($bool$),1,$ input$\_$file$)$;

fread$($&records$[$i$].$volcano, sizeof$($uint$16\_$t$),1,$ input$\_$file$)$;

fread$($&records$[$i$].$achiever, sizeof$($uint$16\_$t$),1,$ input$\_$file$)$;

fread$($&records$[$i$].$shoes, sizeof$($int$8\_$t$),1,$ input$\_$file$)$;

fread$($&records$[$i$].$creator, sizeof$($uint$16\_$t$),1,$ input$\_$file$)$;

fread$($&records$[$i$].$crime, sizeof$($bool$),1,$ input$\_$file$)$;

fread$($&records$[$i$].$feeling, sizeof$($double$),1,$ input$\_$file$)$;

fread$($&records$[$i$].$idea, sizeof$($float$),1,$ input$\_$file$)$;

fread$($&records$[$i$].$cherries, sizeof$($uint$32\_$t$),1,$ input$\_$file$)$;

fread$($&records$[$i$].$beds, sizeof$($double$),1,$ input$\_$file$)$;

$\}$

fclose$($input$\_$file$)$;

qsort$($records$,$ num$\_$records, sizeof$($struct Record$),$ compare$\_$records$)$;

FILE$*$ output$\_$file $=$ fopen$($argv$[2],"$wb$")$;

if $(!$output$\_$file$)\{$

fprintf