#include<stdio.h>

main()
{
  int i,j,a,b;
  int arr[10]={34,77,13,62,4,11,58,90,22,83};
  int cp[10];  
  for(i=0;i<10;i++)
    cp[i]=arr[i];
  
  int key;
  for(i=1;i<10;i++){
    key=i;
    j=i-1;
    while(j>=0&&cp[j]<cp[key]){
      int t=cp[j];
      cp[j]=cp[key];
      cp[key]=t;
      key=j;
      j--;
    }
  }
  for(i=0;i<10;i++)
    if(cp[1]==arr[i])
       j=i;
  printf("%d %d\n",cp[1],j);
}

#include<stdio.h>
main()
{
    int k1[]={0,0}, k2[]={0,0}, arr[]= {34,77,13,62,4,11,58,90,22,83};
    for(int i=0; i<10; i++)
    {
        if(arr[i] > k1[0])
        {
            k1[0] = arr[i];
            k1[1] = i;
        }
        else if(arr[i] < k1[0] && arr[i] > k2[0])
        {
            k2[0] = arr[i];
            k2[1] = i;
        }
    }
    printf("%d %d\n",k2[0],k2[1]);
}

int secondMaxIndex(int *arr, int n)
{/*
  1.求整形数组中第二大元素的下标(15分)
  n表示数组长度
  如数组中元素为81 12 42 67 9 88，返回0
  */

    int max = arr[0]>arr[1]?arr[0]:arr[1];
    int maxIndex =arr[0]>arr[1]?0:1;
    int second = arr[0]<arr[1]?arr[0]:arr[1];
    int secondIndex =arr[0]<arr[1]?0:1;
    for (int i = 2; i < n; i++) {
        if (arr[i] > max) {
            second = max;
            secondIndex = maxIndex;
            max = arr[i];
            maxIndex = i;
        }else if(arr[i] > second){
            second = arr[i];
            secondIndex = i;
        }
    }
    return secondIndex;
}
int sumOfNumber(int a,int n)