//c

#include<stdio.h>
int main()
{
    int t,n,a[1001],sum,max,min;
    char str[10001];
    scanf("%d",&t);
    while(t--){
        sum=0;
        scanf("%d",&n);
        if(n!=16){
            for(int i=0;i<n;i++){
                scanf("%s %d",str,&a[i]);
                if(i==0){
                    max=a[0];
                    min=a[0];
                }
                else{
                    if(a[i]>max){
                    max=a[i];
                    }if(a[i]<min){
                        min=a[i];
                    }
                }
            }printf("%d %d\n",max,min);
            printf("Total number of girls can not be determined!\n");
        }else{
           for(int i=0;i<n;i++){
                scanf("%s %d",str,&a[i]);
                sum+=a[i];
                if(i==0){
                    max=a[0];
                    min=a[0];
                }
                else{
                    if(a[i]>max){
                    max=a[i];
                    }if(a[i]<min){
                        min=a[i];
                    }
                }
            }printf("%d %d %d\n",max,min,sum);

        }
        
    }
    return 0;
}

一行题解😋

for _ in range(int(input())):n=int(input());a=[int(input().split()[1]) for i in range(n)];[print(max(a),min(a),sum(a)) if n==16 else (print(max(a),min(a)),print("Total number of girls can not be determined!"))]

#include<bits/stdc++.h>
using namespace std;

struct sirsters
{
	char name[10]={0};//院系名称
	int  num;//妹子数量
};

int main()
{
	int t,i,sum,mx,mi;
	cin>>t;
	while(t--)
	{
		sum = 0;
		int n;
		cin>>n;
		struct sirsters arr[n];
		for(i=0;i<n;i++)
		{
			cin>>arr[i].name;
			cin>>arr[i].num;
			sum += arr[i].num;//计算妹子总数
		}
		//计算最多和最小
		mx = arr[0].num;
		mi = arr[0].num;
		for(i=1;i<n;i++)
		{
			if(mx<arr[i].num)
			{
				mx = arr[i].num;//最大值
			}
			if(mi>arr[i].num)
			{
				mi = arr[i].num;//最小值
			}
		}
		if(n==16)
		{
			cout<<mx<<" "<<mi<<" "<<sum<<endl;
		}else
		{
			cout<<mx<<" "<<mi<<endl;
			cout<<"Total number of girls can not be determined!"<<endl;
		}
	}
}