Codeforces 1131C. Birthday Solution

Solution in C++:

///**********ALLAH IS ALMIGHTY************///

///AH Tonmoy

///Department of CSE,23rd batch

///Islamic University,Bangladesh  

 #include<iostream>

#include<algorithm>

using namespace std;

int main()

{


    int n,i;

    cin>>n;

    int a[n+1];

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

    {

        cin>>a[i];

    }

    sort(a,a+n);

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

    {

            cout<<a[i]<<" ";

    }

    for(i=n-1; i>=0; i--)

    {

        if(i%2!=0)

            cout<<a[i]<<" ";

    }

    cout<<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.