#include<iostream>
using namespace std;
//算法一（这个考虑更全面）
int cal_score(int score[], int judge[], int N)
{
    int ret = 0, n = 0, m = 0;
    double sum1 = 0, sum2 = 0;
    if (N&&score&&judge)
    {
        for (int i = 0; i < N;i++)
          switch (judge[i])
         {
          case 1:sum1 += score[i]; ++n; break;
          case 2:sum2 += score[i]; ++m; break;
          default:;
          }
        if (n) sum1 = int(sum1 / n);//考虑到专家人数为0，务必确保除数不为0
        if (m) sum2 = int(sum2 / m);
        ret = m ? sum1*0.6 + sum2*0.4 : sum1;
    }
    return ret;
}
//算法二
int cal_score1(int score[], int judge_type[], int n)
{
    int scr = 0;
    int sum1 = 0.0;
    int sum2 = 0.0;
    int cnt = 0;//专家评委.  
    for (int i = 0; i < n; i++)
    {
        if (judge_type[i] == 1)
        {
            cnt++;
            sum1 += score[i];
        }
        else if (judge_type[i] == 2)
            sum2 += score[i];
    }
    if (cnt == n)
        scr = sum1 / cnt;
    scr = 0.6*(sum1 / cnt) + 0.4*(sum2 / (n - cnt));
    return scr;
}
int main()
{
    int n = 10;
    int score[10] = { 80, 85, 90, 80, 75, 95, 80, 90, 95, 92 };
    int judge[10] = { 1, 1, 1, 1, 1, 1, 2, 2, 2, 2 };
    int final_score = cal_score(score, judge, n);
    cout << final_score << endl;
    system("pause");
    return 0;
}