#include <stdio.h>
#define N 100
#define K 2
int main(void)
{
int A[N]={1,2,3,4,5,6};
int B[N];
int count=0, i,maxval,col=0;
for (i=0; i<N; i++)
B[i] = A[i];
while (count < K) //求第K个大的数
{
maxval = B[0];
for (i=0; i<=N-1; i++) //求数组中最大的数
if (B[i] > maxval)
{
maxval = B[i];
col = i;
}
B[col] = 0;
count++;
}
printf("the second value is %d \n",maxval);
return 0;
}