YTU 3172: 最公正的裁判

AC代码：

#include<iostream>#include<algorithm>using namespace std;typedef struct{int v;int p;}num; num a[20];void search(int i){if(a[i].v==a[i-1].v&&i>=2)return search(i-1);else {cout<<a[i].p;return ;}}int cmp(num a,num b){if(a.v!=b.v)return a.v<b.v;else return a.p<b.p;}int  main(void){int i;        int min;int sum=0;int aver;   for(i=1;i<=7;i++){cin>>a[i].v;sum+=a[i].v;a[i].p=i;//初始化位次    }    aver=sum/7;    sort(a+1,a+7+1,cmp);            /*    for(i=1;i<=7;i++)cout<<a[i].v<<" ";    cout<<endl;       for(i=1;i<=7;i++)cout<<a[i].p<<" ";       cout<<endl;        cout<<aver<<endl;    */    for(i=1;i<=7;i++)    {    if(a[i].v==aver){    cout<<a[i].p;    break;    }       if(a[i].v>aver){    if(abs(a[i].v-aver)>=abs(a[i-1].v-aver)){    search(i-1);        }        else {cout<<a[i].p<<endl;break;}        }    }    }