1032. 挖掘机技术哪家强(20)

//1032. 挖掘机技术哪家强(20)#include<stdio.h>#include<stdlib.h>void swap(int *a, int *b){  int temp;  temp = *a;  *a = *b;  *b = temp;}int main(){  int n=0,*num,i=0,j=0,school=0,score=0,x=0,max_school=0,max_score=0;  scanf("%d",&n);  num = (int *)malloc(sizeof(int)*n);  for(i=0; i<n; i++)    num[i] = 0;  i=1;  while(i<=n)  {    scanf("%d%d",&school,&score);    num[school] += score;    if(school>x)              //记录下学校个数      x = school;    i++;  }  for(i=1; i<=x; i++)  {    if(num[i]>max_score)    {      max_score = num[i];      max_school = i;    }  }  printf("%d %d",max_school,max_score);  return 0;}