forked from MukulCode/CodingClubIndia
-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathcirmerg.cpp
135 lines (132 loc) · 2.5 KB
/
cirmerg.cpp
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
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
#include<bits/stdc++.h>
using namespace std;
unsigned long int small(unsigned long int array[], unsigned long int size)
{
unsigned long int index = 0;
for(unsigned long int i = 1; i < size; i++)
{
if(array[i] < array[index])
index = i;
}
return index;
}
int testcase()
{
unsigned long int i,n,s,ans=0,m;
cin>>n;
unsigned long int a[n];
for(i=0;i<n;i++)
{
cin>>a[i];
}
s=n;
if(n>1)
{
do{
m=small(a,s);
//cout<<m<<" "<<s<<endl;
if(m==0)
{
if(a[s]<=a[m+1])
{
a[s]+=a[m];
ans+=a[s];
for(i=m;i<s;i++)
{
a[i]=a[i+1];
}
s--;
}
else
{
a[m]+=a[m+1];
ans+=a[m];
for(i=m+1;i<s;i++)
{
a[i]=a[i+1];
}
s--;
}
}
else if(m==s-1)
{
if(a[m-1]<=a[0])
{
a[m-1]+=a[m];
ans+=a[m-1];
for(i=m;i<s;i++)
{
a[i]=a[i+1];
}
s--;
}
else
{
a[m]+=a[0];
ans+=a[m];
for(i=0;i<s;i++)
{
a[i]=a[i+1];
}
s--;
}
}
else
{
if(a[m-1]<=a[m+1])
{
a[m-1]+=a[m];
ans+=a[m-1];
for(i=m;i<s;i++)
{
a[i]=a[i+1];
}
s--;
}
else
{
a[m]+=a[m+1];
ans+=a[m];
for(i=m+1;i<s;i++)
{
a[i]=a[i+1];
}
s--;
}
}
/* for(i=0;i<s;i++)
{
cout<<"a["<<i<<"]="<<a[i]<<" ";
}
cout<<endl;*/
}while(s>1);
cout<<ans;
}
else{
if(n<=0)
{
cout<<0;
}
else
{
cout<<a[0];
}
}
/*for(i=0;i<s;i++)
{
cout<<a[i]<<" ";
}
cout<<endl<<" "<<s<<" "<<ans;*/
return 0;
}
int main()
{
int t,i;
cin>>t;
for(i=0;i<t;i++)
{
testcase();
cout<<endl;
}
return 0;
}