#include<stdio.h>

int find_maximum(int[], int);
int find_minimum(int[], int);
int jumlah(int[], int);

int main() {
  int i, a[100], input, location, maximum, minimum, u;

  printf("Input number of elements in array\t");
  scanf("%d", &input);

  printf("Enter %d integers\t", input);

  for (i = 0; i < input; i++)
    scanf("%d", &a[i]);

  location = find_maximum(a, input);
  maximum  = a[location];
  location = find_minimum(a, input);
  minimum  = a[location];
  location = jumlah(a, input);
  u = a[location];

  printf("Maximum Score is %d\n", maximum);
  printf("Minimum Score is %d\n", minimum);
  printf("\nTotal Score = %d\n", u);
  return 0;
}

int find_maximum(int d[], int n) {
  int c, max, index;

  max = d[0];
  index = 0;

  for (c = 1; c < n; c++) {
    if (d[c] > max) {
       index = c;
       max = d[c];
    }
  }

  return index;
}
int find_minimum(int f[], int j) {
  int e, min, index;

  min = f[0];
  index = 0;

  for (e = 1; e < j; e++) {
    if (f[e] < min) {
       index = e;
       min = f[e];
    }
  }

  return index;
}
int jumlah(int q[], int input){
    int megumin, u = 0, index;
    for(megumin=0; megumin<input; megumin++)
    {
        u=u+q[megumin];
    }
    return index;
}