Codeforces 1613B - Absent Remainder 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,s;

        cin>>t;

        while(t--)

        {

            cin>>n;

            int a[n+9];

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

                cin>>a[i];

            sort(a,a+n);

            for(i=1; i<n; i+=2)

            cout<<a[i]<<" "<<a[0]<<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.