1 条题解

  • 0
    @ 2025-2-14 20:50:07

    C :

    #include<stdio.h> 
    #define N 40 
    int ReadScore(int score[],long num[]); 
    int FindMax(int score[],int n); 
    int main() 
    { 
        int score[N],maxNum,n; 
        long num[N]; 
        n=ReadScore(score,num);
        maxNum=FindMax(score,n);
        printf("%d %d\n",num[maxNum],score[maxNum]);
    	return 0; 
    } 
    int ReadScore(int score[],long num[]) 
    { 
        int i=-1; 
        do{ 
        i++;  
        scanf("%ld%d",&num[i],&score[i]); 
        }while(num[i]>0&&score[i]>=0); 
        return i; 
    } 
    int FindMax(int score[],int n) 
    { 
        int max=score[0],i,maxNum=0; 
        for(i=1;i<n;i++) 
        { 
            if(score[i]>max) 
            {
            	max=score[i]; 
            	maxNum=i;
            }
        } 
        return maxNum; 
    } 
    

    C++ :

    #include <iostream>
    using namespace std;
    int main()
    {
    	int maxNum, maxScore;
    	int tmpNum = 0,tmpScore = 0;
    
    	while (!(tmpNum<0 || tmpScore<0))
    	{
    		cin >> tmpNum >> tmpScore;
    		if (tmpScore>maxScore)
    		{
    			maxScore = tmpScore;
    			maxNum = tmpNum;
    		}
    	}
    
    	cout << maxNum << " " << maxScore << endl;
    	return 0;
    }
    
    • 1

    信息

    ID
    393
    时间
    1000ms
    内存
    2MiB
    难度
    (无)
    标签
    递交数
    0
    已通过
    0
    上传者