简单模拟 | 北邮OJ | 88. 最值问题

https://vpn.bupt.edu.cn/http/10.105.242.80/problem/p/88/

#include <bits/stdc++.h>
#define FF(a,b) for(int a=0;a<b;a++)
#define F(a,b) for(int a=1;a<=b;a++)
#define LEN 510000
#define INF 1000000
#define bug(x) cout<<#x<<"="<<x<<endl;

using namespace std;
typedef long long ll;

int main()
{
//    freopen("./in","r",stdin);
    int N;
    scanf("%d",&N);
    while(N--){
        int n;
        scanf("%d",&n);
        int m1=-1,m2=-1,t;
        while(n--){
            scanf("%d",&t);
            if(t>m1){
                m2=m1;
                m1=t;
            }else if(t>m2){
                m2=t;
            }
        }
        printf("%d %d\n",m1,m2);
    }
    return 0;
}