1197A - DIY Wooden Ladder

#include <iostream>

#include<vector>

#include<string>

#include<math.h>

#include<set>

#include<map>

#include<list>

#include<stack>

#include<queue>

#include <fstream>

#include<iterator>

#include<algorithm>

#include <iomanip>      // std::setprecision

/* ==================================================

  |                                                  |

  |    Author: *** S. M. Sabiul Hajjaj Sabit ***     |

  |       Last Edit:  May,14,2019                    |

   ================================================== */

///***global declaration***///

#define all(arr) arr.begin(),arr.end()

#define pb push_back

#define lb lower_bound

#define up upper_bound

#define sz(x) x.size()

#define min3(a,b,c)  min(min(a,b),c)

#define max3(a,b,c)  max(max(a,b),c)

#define lli long long int

#define prnt(x) cout<<x<<endl

using namespace std;

int j,n,m,sum=0,ans=0;

template <typename T>long long int power(T a, T b)

{

    long long int pow=1;

    for(int i=0; i<b; i++)

        pow *= a;

    return pow;

}

/**** ascending sort vector of pair basis fd 2nd element******/

//sort(arr.begin(), arr.end(),sortbysec);

bool sortbysec(const pair<int,int> &a,const pair<int,int> &b)

{

    return (a.second < b.second);

}

/////*********Write Code From Here*********///

int main()

{

    int t;

    cin>>t;

    for(int i=0;i<t;i++)

    {

        vector<int>arr;

        int n;

        cin>>n;

        for(int j=0;j<n;j++)

        {

            int a;

            cin>>a;

            arr.pb(a);

        }

        sort(all(arr));

        int maxL1 = arr[n-1];

        int maxL2 = arr[n-2];

        int count=0;

        for(int k=0;k<n-2;k++)

        {

            if(count<maxL2-1)

                count++;

        }

        prnt(count);

    }

}