https://mediawiki.zeropage.org/index.php?action=history&feed=atom&title=Bridge%2F%EA%B6%8C%EC%98%81%EA%B8%B0 2026-05-15T09:52:36Z Revision history for this page on the wiki MediaWiki 1.39.8 https://mediawiki.zeropage.org/index.php?title=Bridge/%EA%B6%8C%EC%98%81%EA%B8%B0&diff=29395&oldid=prev 2012-08-31T04:47:48Z

<p></p> <p><b>New page</b></p><div> <br /> #include&amp;lt;stdio.h&amp;gt;<br /> #include&amp;lt;memory.h&amp;gt;<br /> #include&amp;lt;algorithm&amp;gt;<br /> #include&amp;lt;queue&amp;gt;<br /> using namespace std;<br /> #define N 1020<br /> queue &amp;lt; pair&amp;lt; int, int&amp;gt; &amp;gt; ans2;<br /> int main(void)<br /> {<br /> <br /> // freopen(&quot;input.txt&quot;,&quot;r&quot;,stdin);<br /> // freopen(&quot;output.txt&quot;,&quot;w&quot;,stdout);<br /> <br /> int t, n, tempn, p, ans = 0;<br /> int man[N];<br /> scanf(&quot;%d&quot;, &amp;amp;t);<br /> <br /> for(int i = 0; i&amp;lt;t; i++){<br /> scanf(&quot;%d&quot;, &amp;amp;n);<br /> memset(man, 0, sizeof(int) * N);<br /> ans = 0;<br /> for(int j = 0; j&amp;lt;n; j++){<br /> scanf(&quot;%d&quot;, &amp;amp;man[j]);<br /> }<br /> sort(man, man + n);<br /> tempn = n;<br /> p = n-1;<br /> <br /> while(tempn &amp;gt; 0){<br /> if(tempn &amp;gt;= 4){<br /> if(man[0] + man[1] + man[p] + man[1] &amp;gt; man[p] + man[0] + man[p-1] + man[0]){<br /> ans += man[p] + man[0] + man[p-1] + man[0];<br /> ans2.push(make_pair(man[0], man[p]));<br /> ans2.push(make_pair(man[0], -1));<br /> ans2.push(make_pair(man[0], man[p-1]));<br /> ans2.push(make_pair(man[0], -1));<br /> }<br /> else{<br /> ans += man[0] + man[1] + man[p] + man[1];<br /> ans2.push(make_pair(man[0], man[1]));<br /> ans2.push(make_pair(man[0], -1));<br /> ans2.push(make_pair(man[p-1], man[p]));<br /> ans2.push(make_pair(man[1], -1));<br /> }<br /> tempn -= 2;<br /> p -= 2;<br /> }<br /> else{<br /> if(tempn == 3){<br /> ans += man[0] + man[p] + man[1];<br /> ans2.push(make_pair(man[0], man[p]));<br /> ans2.push(make_pair(man[0], -1));<br /> ans2.push(make_pair(man[0], man[1]));<br /> tempn = 0;<br /> }<br /> else if(tempn == 2){<br /> ans += man[1];<br /> ans2.push(make_pair(man[0], man[1]));<br /> tempn = 0;<br /> }<br /> else if(tempn == 1){<br /> ans += man[0];<br /> ans2.push(make_pair(man[0], -1));<br /> tempn = 0;<br /> }<br /> }<br /> }<br /> <br /> printf(&quot;%d\n&quot;, ans);<br /> while(!ans2.empty()){<br /> pair &amp;lt;int, int&amp;gt; temp;<br /> temp = ans2.front();<br /> ans2.pop();<br /> printf(&quot;%d&quot;, temp.first);<br /> if(temp.second != -1)printf(&quot; %d&quot;, temp.second);<br /> printf(&quot;\n&quot;);<br /> }<br /> if(i != t-1)printf(&quot;\n&quot;);<br /> }<br /> <br /> <br /> }<br /> <br /> 10545698 10037 Bridge Accepted C++ 0.012 2012-08-31 04:45:34<br /> </div>

imported>trailblaze