求各位大侠帮忙啊！！输入一个数，如何得出小的当中最大的，大的当中最小的 ...

循环每项，记录找到的最小的，继续循环，比较当前项是否小于前面找到的最小的，如果是，把此项记录为最小的比较项
----------------解决方案--------------------------------------------------------
# define N 36
main()
{struct Kmz
   {float v;
    float k;
    }vKmz[N]={{200,0.0095},{260,0.0095},{280,0.0096},{300,0.0098},{320,0.0100},{340,0.0104},{360,0.0105},{380,0.0105},{400,0.0105},{420,0.0104},{440,0.0103},{460,0.0102},{480,0.0101},{500,0.0101},{520,0.0100},{540,0.0099},{560,0.0098},{580,0.0098},{600,0.0097},{620,0.0096},{640,0.0096},{660,0.0095},{680,0.0095},{700,0.0094},{720,0.0094},{740,0.0093},{760,0.0092},{780,0.0091},{800,0.0091},{850,0.0090},{900,0.0089},{950,0.0088},{1000,0.0088},{1050,0.0088},{1100,0.0087},{1150,0.0086}};
float a,x,y;
int i,j,k;
scanf ("%f",&a);
    for (j=0;vKmz[j].v<a&&j<=35;j++);
    for (i=0;i<j;i++);
{ printf ("%f ,%f \n",vKmz[i].v,vKmz[i-1].v);}
}
今天无意间编成这样，可以得出结果！但是完全不知道什么意思！各位大大能不能帮我解释一下！谢谢了！
----------------解决方案--------------------------------------------------------