Codeforce1669 A和B

#include<bits/stdc++.h>
using namespace std;
int main()
{
    int T;
    cin>>T;
    int n;
    while(T--)
    {
        cin>>n;
        if(n>=1900)
        {
            cout<<"Division 1"<<endl;
            continue;
        }
        if(n<=1899&&n>=1600)
        {
            cout<<"Division 2"<<endl;
            continue;
        }
        if(n<=1599&&n>=1400)
        {
            cout<<"Division 3"<<endl;
            continue;
        }
        if(n<=1399)
            {
            cout<<"Division 4"<<endl;
            continue;
            }
    }
    return 0;
}

#include <iostream>
#include <map>
#include <iterator>
using namespace std;
typedef map<int,int> MAPINT;
int main()
{

    int T;
    cin>>T;
    int k=1;
    while(T--)
    {
    MAPINT v;
    int n,max=0;
    int t;
    cin>>n;
    for (int i=0;i<n;i++)
    {
        cin>>t;
        v[t]++;
    }
    for(MAPINT::iterator ip=v.begin();ip!=v.end();ip++)
    {
        if(ip->second>max)
        {
            max=ip->second;
   //         cout<<"max"<<max<<endl;

        if(ip->first)
            {
            t=ip->first;
            }
        }

    }
    if(max<3)
        {
            cout<<"-1"<<endl;
            k=0;
        }
    if(k==1)
    cout<<t<<endl;
    k=1;
    }
    return 0;
}