MIST-National Collegiate Programming Contest, 2020 Problem K Respectfully Giving Away Solution

   ///La ilaha illellahu muhammadur rasulullah

///******Bismillahir-Rahmanir-Rahim******///

///Abul Hasnat  Tonmoy

///Department of CSE,23rd batch

    ///Islamic University,Bangladesh

    #include <bits/stdc++.h>

    using namespace std;

    int main()

    {

        int t,n,i;

        cin>>t;

        while(t--)

        {

            cin>>n;

            int a[n+9];

            for(i=0;i<n;i++)

            cin>>a[i];


            sort(a,a+n);

            if(a[n-1]!=a[n-2])

            cout<<"Yes"<<endl;

            else

            cout<<"No"<<endl;

        }

    }



    No comments

    Most View Post

    Recent post

    Codeforces Round 925 (Div. 3) 1931D. Divisible Pairs Solution

        Problem Link  :   https://codeforces.com/contest/1931/problem/D S olution in C++: /// Author : AH_Tonmoy #include < bits / stdc ++. ...

    Powered by Blogger.