Competitive_coding/JMSicpc.cpp at master · shashank3395/Competitive_coding · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
#include<bits/stdc++.h>

using namespace std;

int main()
{
    int t;
    cin>>t;
    while(t--)
    {
        int n,k,e;
        cin>>n>>k;

        vector<int> v;
        int flag=0;
        long long int sum=0;
        for(int i=0;i<n;i++)
        {
            cin>>e;
            v.push_back(e);
            sum+=e;
            if(e>k)
                flag++;

        }

        sort(v.begin(),v.end());
        vector<int>::iterator it,it1;
        it=upper_bound(v.begin(),v.end(),k);
       // int l=it-v.begin();

        int last=v.back();

        if(flag==0)
            cout<<sum<<"\n";
        else if(flag==1)
                cout<<sum<<"\n";
        else
        {
            if(n==1)
                cout<<sum<<"\n";
            else if(n==2)
            {
                if(v.front()>k)
                    cout<<sum-2*(v.front()-k)<<"\n";
                else
                    cout<<sum<<"\n";
            }
            else
            {

            long long int sub1=0,sub2=0;
            for(;(it!=v.end()-2)&&(it!=v.end()-1)&&(it!=v.end());it++)
                {sub1+=(*it-k); //cout<<"-"<<*it<<"-";}
                if(*it>k)
                    sub2=*it-k;
                if(sub2<=sub1)
            {
            if((sub1+sub2)%2==0)
                cout<<sum-sub1-sub2<<"\n";
            else
                cout<<sum-sub1-sub2-1<<"\n";
            }
            else
            {
                int remaining=sub2-sub1;
                cout<<sum-sub1-sub2-remaining<<"\n";
            }
            }

        }

    }
}