T049 Death Beach

#include <stdio.h>voidSelectionsort (intA[],intN) to facilitate comparison, first sort {intI, J, K, T;  for(i=0; i<n-1; i++) {k=i;  for(j=i;j<n;j++)        {            if(a[j]<A[k]) k=J; } t=A[i]; A[i]=A[k]; A[K]=T; }}intMain () {intN, M, I, J, K, sum=0; inta[Ten], b[Ten]; scanf ("%d%d", &n, &m); if(n>m) {printf ("NULL"); If you can't kill your tentacles, GG}Else    {         for(i=0; i<n;i++) {scanf ("%d", &A[i]); }         for(j=0; j<m;j++) {scanf ("%d", &B[j]);        } selectionsearch (A,n);        Selectionsearch (B,M);  for(i=0; i<n;i++)        {             for(j=0; j<m;j++) {k=0; if(b[j]>=A[i]) {k=k+1; Sum+=B[j]; }                if(k!=0)//Initialize the compared and calculated elements to 0, guaranteeing no repetition of the operation {B[j]=0; }                if(k==0)Continue; Else  Break; }} printf ("%d\n", sum); }    return 0;}

T049 Death Beach