blocks|key|930438|text|JavaScript+(ES6)，33字节|type|header-two|depth|inlineStyleRanges|entityRanges|data|930439|a=>a.reduce((m,n)=>n*n-n<m*m?n:m)|code-block|syntax|javascript|930440|Demo|930441|let+f+=

a=>a.reduce((m,n)=>n*n-n<m*m?n:m)

console.log(f([1,+-2,+-8,+4,+5]))|entityMap^0|0|0|0^^$0|@$1|2|3|4|5|6|7|L|8|@]|9|@]|A|$]]|$1|B|3|C|5|D|7|M|8|@]|9|@]|A|$E|F]]|$1|G|3|H|5|6|7|N|8|@]|9|@]|A|$]]|$1|I|3|J|5|D|7|O|8|@]|9|@]|A|$E|F]]]|K|$]]

<h2>JavaScript (ES6), 33 bytes</h2>

<pre class="lang-js prettyprint-override"><code>a=&gt;a.reduce((m,n)=&gt;n*n-n&lt;m*m?n:m)
</code></pre>

<h3>Demo</h3>

<p><div class="snippet" data-lang="js" data-hide="true" data-console="true" data-babel="false">
<div class="snippet-code snippet-currently-hidden">
<pre class="snippet-code-js lang-js prettyprint-override"><code>let f =

a=&gt;a.reduce((m,n)=&gt;n*n-n&lt;m*m?n:m)

console.log(f([1, -2, -8, 4, 5]))</code></pre>
</div>
</div>
</p>


blocks|key|6358088|text|Python，35字节|type|header-two|depth|inlineStyleRanges|entityRanges|offset|length|data|6358089|lambda+l:max((-x*x,x)for+x+in+l)[1]|code-block|syntax|javascript|6358090|在网上试试！|unstyled|6358091|险胜：|6358092|lambda+l:min(l,key=lambda+x:2*x*x-x)
lambda+l:min(sorted(l)[::-1],key=abs)|entityMap|0|LINK|mutability|MUTABLE|url|https://docs.python.org/2/|1|https://tio.run/nexus/python2#S7ON@Z@TmJuUkqiQY5WbWKGhoVuhVaFToZmWX6RQoZCZp5CjGW0Y@7@gKDOvRCFNI1rXSMdQR9cwVpMLWchIxyRW8z8A^0|0|6|0|0|0|0|6|1|0|0^^$0|@$1|2|3|4|5|6|7|Y|8|@]|9|@$A|Z|B|10|1|11]]|C|$]]|$1|D|3|E|5|F|7|12|8|@]|9|@]|C|$G|H]]|$1|I|3|J|5|K|7|13|8|@]|9|@$A|14|B|15|1|16]]|C|$]]|$1|L|3|M|5|K|7|17|8|@]|9|@]|C|$]]|$1|N|3|O|5|F|7|18|8|@]|9|@]|C|$G|H]]]|P|$Q|$5|R|S|T|C|$U|V]]|W|$5|R|S|T|C|$U|X]]]]

<h1><a href="https://docs.python.org/2/" rel="noreferrer">Python</a>, 35 bytes</h1>



<pre class="lang-python prettyprint-override"><code>lambda l:max((-x*x,x)for x in l)[1]
</code></pre>

<p><a href="https://tio.run/nexus/python2#S7ON@Z@TmJuUkqiQY5WbWKGhoVuhVaFToZmWX6RQoZCZp5CjGW0Y@7@gKDOvRCFNI1rXSMdQR9cwVpMLWchIxyRW8z8A" rel="noreferrer" title="Python 2 – TIO Nexus">Try it online!</a></p>

<p>Narrowly beats: </p>

<pre class="lang-python prettyprint-override"><code>lambda l:min(l,key=lambda x:2*x*x-x)
lambda l:min(sorted(l)[::-1],key=abs)
</code></pre>


blocks|key|6357981|text|果冻，4字节|type|header-two|depth|inlineStyleRanges|entityRanges|offset|length|data|6357982|AÐṂṀ|code-block|syntax|javascript|6357983|在网上试试！|unstyled|6357984|是如何工作的|6357985|AÐṂṀ++Main+link.+Argument:+A+(array)

AÐṂ+++Take+all+elements+with+minimal+absolute+value.
+++Ṁ++Take+the+maximum.+Yields+0+for+an+empty+list.|entityMap|0|LINK|mutability|MUTABLE|url|https://github.com/DennisMitchell/jelly|1|https://tio.run/nexus/jelly#@@94eMLDnU0Pdzb8P9z@qGmN@///0YY6CrpGQGyho2Cio2Aaq6MQDcKmQCHTWAA^0|0|2|0|0|0|0|6|1|0|0^^$0|@$1|2|3|4|5|6|7|Y|8|@]|9|@$A|Z|B|10|1|11]]|C|$]]|$1|D|3|E|5|F|7|12|8|@]|9|@]|C|$G|H]]|$1|I|3|J|5|K|7|13|8|@]|9|@$A|14|B|15|1|16]]|C|$]]|$1|L|3|M|5|6|7|17|8|@]|9|@]|C|$]]|$1|N|3|O|5|F|7|18|8|@]|9|@]|C|$G|H]]]|P|$Q|$5|R|S|T|C|$U|V]]|W|$5|R|S|T|C|$U|X]]]]

<h1><a href="https://github.com/DennisMitchell/jelly" rel="noreferrer">Jelly</a>, 4 bytes</h1>

<pre><code>AÐṂṀ
</code></pre>

<p><a href="https://tio.run/nexus/jelly#@@94eMLDnU0Pdzb8P9z@qGmN@///0YY6CrpGQGyho2Cio2Aaq6MQDcKmQCHTWAA" rel="noreferrer" title="Jelly – TIO Nexus">Try it online!</a></p>

<h3>How it works</h3>

<pre><code>AÐṂṀ  Main link. Argument: A (array)

AÐṂ   Take all elements with minimal absolute value.
   Ṁ  Take the maximum. Yields 0 for an empty list.
</code></pre>


blocks|key|930746|text|布氏对数+(2)、5或2字节|type|header-two|depth|inlineStyleRanges|entityRanges|offset|length|data|930747|~{≜∈}|code-block|syntax|javascript|930748|在网上试试！|unstyled|930749|如果有一个类似果冻或派克的更短的解决方案，我不会感到惊讶，但我喜欢这个，因为它太奇怪了。|930750|这就是Brachylog的“查找包含输入的列表”操作符∈，它的计算策略≜只是尝试显式的整数值，直到找到一个有效的值(并且它碰巧以0、1、-2、-+2、3等的顺序尝试，这对于这个问题来说非常方便！)和倒置的~+(因此，它不是试图找到包含输入的输出列表，而是试图找到包含在输入列表中的输出)。不幸的是，转换一个评估策略以及值本身需要花费2个字节，所以这并不能超过Jelly或Pyke解决方案。|style|CODE|930751|还有一个可疑的2字节解决方案≜∈。所有Prolog谓词都有两个参数，每个参数都可以是输入或输出；按照约定，第一个参数用作输入，第二个参数用作输出，但实际上没有强制执行，因为调用方对所使用的参数模式有完全的控制(而在Prolog中，Brachylog编译到的Prolog中，没有关于参数顺序的真正约定)。如果通过第二个参数获取输入并通过第一个参数产生输出的解决方案是可以接受的，则不需要进行反转。|entityMap|0|LINK|mutability|MUTABLE|url|https://github.com/JCumin/Brachylog|1|https://tio.run/nexus/brachylog2#@19X/ahzzqOOjtr//6N1TXVMdcx0dA2NYv9HAQA^0|0|4|0|0|0|0|6|1|0|0|R|1|Z|1|2U|1|0|E|2^^$0|@$1|2|3|4|5|6|7|12|8|@]|9|@$A|13|B|14|1|15]]|C|$]]|$1|D|3|E|5|F|7|16|8|@]|9|@]|C|$G|H]]|$1|I|3|J|5|K|7|17|8|@]|9|@$A|18|B|19|1|1A]]|C|$]]|$1|L|3|M|5|K|7|1B|8|@]|9|@]|C|$]]|$1|N|3|O|5|K|7|1C|8|@$A|1D|B|1E|P|Q]|$A|1F|B|1G|P|Q]|$A|1H|B|1I|P|Q]]|9|@]|C|$]]|$1|R|3|S|5|K|7|1J|8|@$A|1K|B|1L|P|Q]]|9|@]|C|$]]]|T|$U|$5|V|W|X|C|$Y|Z]]|10|$5|V|W|X|C|$Y|11]]]]

<h1><a href="https://github.com/JCumin/Brachylog" rel="nofollow noreferrer">Brachylog</a> (2), 5 or 2 bytes</h1>

<pre><code>~{≜∈}
</code></pre>

<p><a href="https://tio.run/nexus/brachylog2#@19X/ahzzqOOjtr//6N1TXVMdcx0dA2NYv9HAQA" rel="nofollow noreferrer" title="Brachylog – TIO Nexus">Try it online!</a></p>

<p>It wouldn't surprise me if there were a shorter solution along the lines of the Jelly or Pyke, but I like this one because it's so weird.</p>

<p>This is simply Brachylog's "find a list containing the input" operator <code>∈</code>, with an evaluation strategy <code>≜</code> that simply tries explicit values for integers until it finds one that works (and it happens to try in the order 0, 1, -1, 2, -2, 3, etc., which is surprisingly handy for this problem!), and inverted <code>~</code> (so that instead of trying to find an output list containing the input, it's trying to find an output contained in the input list). Unfortunately, inverting an evaluation strategy along with the value itself costs 2 bytes, so this doesn't beat the Jelly or Pyke solutions.</p>

<p>There's also a dubious 2-byte solution <code>≜∈</code>. All Brachylog predicates take exactly two arguments, which can each be inputs or outputs; by convention, the first is used as an input and the second is used as an output, but nothing actually enforces this, as the caller has complete control over the argument pattern used (and in Prolog, which Brachylog compiles to, there's no real convention about argument order). If a solution which takes input through its second argument and produces output through its first argument is acceptable, there's no requirement to do the inversion.</p>


blocks|key|6358757|text|R，31字节|type|header-two|depth|inlineStyleRanges|entityRanges|offset|length|data|6358758|(l=scan())[order(abs(l),-l)][1]|code-block|syntax|javascript|6358759|在网上试试！|unstyled|entityMap|0|LINK|mutability|MUTABLE|url|https://www.r-project.org/|1|https://tio.run/##K/r/XyPHtjg5MU9DUzM6vygltUgjMalYI0dTRzdHMzbaMPa/rqmC6X8A^0|0|1|0|0|0|0|6|1^^$0|@$1|2|3|4|5|6|7|U|8|@]|9|@$A|V|B|W|1|X]]|C|$]]|$1|D|3|E|5|F|7|Y|8|@]|9|@]|C|$G|H]]|$1|I|3|J|5|K|7|Z|8|@]|9|@$A|10|B|11|1|12]]|C|$]]]|L|$M|$5|N|O|P|C|$Q|R]]|S|$5|N|O|P|C|$Q|T]]]]

<h1><a href="https://www.r-project.org/" rel="nofollow noreferrer">R</a>, 31 bytes</h1>



<pre class="lang-r prettyprint-override"><code>(l=scan())[order(abs(l),-l)][1]
</code></pre>

<p><a href="https://tio.run/##K/r/XyPHtjg5MU9DUzM6vygltUgjMalYI0dTRzdHMzbaMPa/rqmC6X8A" rel="nofollow noreferrer" title="R – Try It Online">Try it online!</a></p>


blocks|key|6357886|text|Pyke，4字节|type|header-two|depth|inlineStyleRanges|entityRanges|data|6357887|S_0%5E|code-block|syntax|javascript|6357888|在网上试试！|unstyled|offset|length|6357889|S_+++-+reversed(sorted(input))
++0%5E+-+closest_to(%5E,+0)|entityMap|0|LINK|mutability|MUTABLE|url|https://tio.run/nexus/pyke#@x8cbxD3/7@uoY4CEOkaAbGFjoKJjoIpAA^0|0|0|0|6|0|0^^$0|@$1|2|3|4|5|6|7|U|8|@]|9|@]|A|$]]|$1|B|3|C|5|D|7|V|8|@]|9|@]|A|$E|F]]|$1|G|3|H|5|I|7|W|8|@]|9|@$J|X|K|Y|1|Z]]|A|$]]|$1|L|3|M|5|D|7|10|8|@]|9|@]|A|$E|F]]]|N|$O|$5|P|Q|R|A|$S|T]]]]

<h2>Pyke, 4 bytes</h2>
<pre><code>S_0^
</code></pre>
<p><a href="https://tio.run/nexus/pyke#@x8cbxD3/7@uoY4CEOkaAbGFjoKJjoIpAA" rel="nofollow noreferrer" title="Pyke – TIO Nexus">Try it online!</a></p>
<pre><code>S_   - reversed(sorted(input))
  0^ - closest_to(^, 0)
</code></pre>


blocks|key|6358220|text|C%2B%2B14，64字节|type|header-two|depth|inlineStyleRanges|entityRanges|data|6358221|作为未命名的lambda，期望第一个参数类似于vector<int>，并通过引用参数重放。|unstyled|offset|length|style|CODE|6358222|[](auto+L,int&r){r=L[0];for(int+x:L)r=x*x<=r*r?r%2Bx?x:x>r?x:r:r;}|code-block|syntax|javascript|6358223|未打高尔夫球和使用：|6358224|#include<iostream>
#include<vector>

auto+f=
[](auto+L,int&r){+
++r=L[0];
++for(int+x:L)
++++r+=+x*x<=r*r+?+++//x+is+absolute+less+or+equal
++++++r%2Bx+?++++++++++//r==-x?
++++++++x+:++++++++++//no,+just+take+x
++++++++x>r+?++++++++//take+the+positive+one
++++++++++x+:
++++++++++r++++++:
++++++r++++++++++++++//x+was+absolute+greater,+so+keep+r
++++;
}
;

int+main(){
+std::vector<int>+v+=+{5,+2,+-2,+-8,+4,+-1,+1};
+int+r;
+f(v,r);
+std::cout+<<+r+<<+std::endl;
}|entityMap^0|0|N|B|0|0|0^^$0|@$1|2|3|4|5|6|7|S|8|@]|9|@]|A|$]]|$1|B|3|C|5|D|7|T|8|@$E|U|F|V|G|H]]|9|@]|A|$]]|$1|I|3|J|5|K|7|W|8|@]|9|@]|A|$L|M]]|$1|N|3|O|5|D|7|X|8|@]|9|@]|A|$]]|$1|P|3|Q|5|K|7|Y|8|@]|9|@]|A|$L|M]]]|R|$]]

<h1>C++14, 64 bytes</h1>

<p>As unnamed lambda, expecting first argument to be like <code>vector&lt;int&gt;</code> and returing via reference parameter.</p>
<pre class="lang-cpp prettyprint-override"><code>[](auto L,int&amp;r){r=L[0];for(int x:L)r=x*x&lt;=r*r?r+x?x:x&gt;r?x:r:r;}
</code></pre>
<p>Ungolfed and usage:</p>
<pre class="lang-cpp prettyprint-override"><code>#include&lt;iostream&gt;
#include&lt;vector&gt;

auto f=
[](auto L,int&amp;r){ 
  r=L[0];
  for(int x:L)
    r = x*x&lt;=r*r ?   //x is absolute less or equal
      r+x ?          //r==-x?
        x :          //no, just take x
        x&gt;r ?        //take the positive one
          x :
          r      :
      r              //x was absolute greater, so keep r
    ;
}
;

int main(){
 std::vector&lt;int&gt; v = {5, 2, -2, -8, 4, -1, 1};
 int r;
 f(v,r);
 std::cout &lt;&lt; r &lt;&lt; std::endl;
}
</code></pre>


blocks|key|6358730|text|杰夫特+-g，3字节|type|header-two|depth|inlineStyleRanges|offset|length|style|CODE|entityRanges|data|6358731|ña¼|code-block|syntax|javascript|6358732|在网上试试！|unstyled|6358733|杰夫特，5字节|6358734|ña¼+v|6358735|entityMap|0|LINK|mutability|MUTABLE|url|https://github.com/ETHproductions/japt|1|https://tio.run/##y0osKPn///DGxEN7/v@PNlUwVNA1UtC1UDBRMI3l4tJNBwA|2|3|https://tio.run/##y0osKPn///DGxEN7FMr@/4/WNVUwjQUA^0|4|2|0|3|0|0|0|0|6|1|0|0|3|2|0|0|0|6|3^^$0|@$1|2|3|4|5|6|7|14|8|@$9|15|A|16|B|C]]|D|@$9|17|A|18|1|19]]|E|$]]|$1|F|3|G|5|H|7|1A|8|@]|D|@]|E|$I|J]]|$1|K|3|L|5|M|7|1B|8|@]|D|@$9|1C|A|1D|1|1E]]|E|$]]|$1|N|3|O|5|6|7|1F|8|@]|D|@$9|1G|A|1H|1|1I]]|E|$]]|$1|P|3|Q|5|H|7|1J|8|@]|D|@]|E|$I|J]]|$1|R|3|L|5|M|7|1K|8|@]|D|@$9|1L|A|1M|1|1N]]|E|$]]]|S|$T|$5|U|V|W|E|$X|Y]]|Z|$5|U|V|W|E|$X|10]]|11|$5|U|V|W|E|$X|Y]]|12|$5|U|V|W|E|$X|13]]]]

<h1><a href="https://github.com/ETHproductions/japt" rel="nofollow noreferrer">Japt</a> <code>-g</code>, 3 bytes</h1>

<pre><code>ña¼
</code></pre>

<p><a href="https://tio.run/##y0osKPn///DGxEN7/v@PNlUwVNA1UtC1UDBRMI3l4tJNBwA" rel="nofollow noreferrer" title="Japt – Try It Online">Try it online!</a></p>

<h1><a href="https://github.com/ETHproductions/japt" rel="nofollow noreferrer">Japt</a>, 5 bytes</h1>

<pre><code>ña¼ v
</code></pre>

<p><a href="https://tio.run/##y0osKPn///DGxEN7FMr@/4/WNVUwjQUA" rel="nofollow noreferrer" title="Japt – Try It Online">Try it online!</a></p>


blocks|key|6357845|text|05AB1E，16字节|type|header-two|depth|inlineStyleRanges|entityRanges|offset|length|data|6357846|Îåà_Di¹{RDÄßs\kè|code-block|syntax|javascript|6357847|解释：|unstyled|6357848|Î+++++++++++++++++Push+0+and+[implicit]+input+array
+å++++++++++++++++For+each+element+in+the+array,+is+it+a+0?
++à+++++++++++++++Find+the+greatest+value+(1+if+there+was+a+0+in+it,+0+otherwise)
+++_++++++++++++++Negate+boolean+(0+->+1,+1+->+0)
++++D+++++++++++++Duplicate
+++++i++++++++++++If+true,+continue
++++++¹+++++++++++Push+input
+++++++R++++++++++Reversed
++++++++D+++++++++Duplicated
+++++++++Ä++++++++Absolute+value
++++++++++ß+++++++Greatest+element
+++++++++++s++++++Swap+top+two+values+in+stack
++++++++++++\+++++Delete+topmost+value+in+stack
+++++++++++++k++++Index+of+greatest+element+in+the+array
++++++++++++++è+++Value+of+the+index+in+the+input+array|6357849|在网上试试！|6357850|不像我想的那么短，但至少起作用了。|entityMap|0|LINK|mutability|MUTABLE|url|https://github.com/Adriandmen/05AB1E|1|https://tio.run/nexus/05ab1e#@3@47/DSwwviXTIP7awOcjnccnh@cUz24RX//0frmugo6BoBsYWOApBpCmQBKSMw0jWMBQA^0|0|6|0|0|0|0|0|0|6|1|0^^$0|@$1|2|3|4|5|6|7|10|8|@]|9|@$A|11|B|12|1|13]]|C|$]]|$1|D|3|E|5|F|7|14|8|@]|9|@]|C|$G|H]]|$1|I|3|J|5|K|7|15|8|@]|9|@]|C|$]]|$1|L|3|M|5|F|7|16|8|@]|9|@]|C|$G|H]]|$1|N|3|O|5|K|7|17|8|@]|9|@$A|18|B|19|1|1A]]|C|$]]|$1|P|3|Q|5|K|7|1B|8|@]|9|@]|C|$]]]|R|$S|$5|T|U|V|C|$W|X]]|Y|$5|T|U|V|C|$W|Z]]]]

<h1><a href="https://github.com/Adriandmen/05AB1E" rel="nofollow noreferrer">05AB1E</a>, 16 bytes</h1>

<pre><code>Îåà_Di¹{RDÄßs\kè
</code></pre>

<p>Explanation:</p>

<pre><code>Î                 Push 0 and [implicit] input array
 å                For each element in the array, is it a 0?
  à               Find the greatest value (1 if there was a 0 in it, 0 otherwise)
   _              Negate boolean (0 -&gt; 1, 1 -&gt; 0)
    D             Duplicate
     i            If true, continue
      ¹           Push input
       R          Reversed
        D         Duplicated
         Ä        Absolute value
          ß       Greatest element
           s      Swap top two values in stack
            \     Delete topmost value in stack
             k    Index of greatest element in the array
              è   Value of the index in the input array
</code></pre>

<p><a href="https://tio.run/nexus/05ab1e#@3@47/DSwwviXTIP7awOcjnccnh@cUz24RX//0frmugo6BoBsYWOApBpCmQBKSMw0jWMBQA" rel="nofollow noreferrer" title="05AB1E – TIO Nexus">Try it online!</a></p>

<p>Not at short as I'd like, but at least it works.</p>


blocks|key|6358114|text|Ruby，20字节|type|header-two|depth|inlineStyleRanges|entityRanges|data|6358115|->n{n.min{%7Cx%7Cx.abs}}|code-block|syntax|javascript|6358116|非常简单的解决方案。:)|unstyled|entityMap^0|0|0^^$0|@$1|2|3|4|5|6|7|K|8|@]|9|@]|A|$]]|$1|B|3|C|5|D|7|L|8|@]|9|@]|A|$E|F]]|$1|G|3|H|5|I|7|M|8|@]|9|@]|A|$]]]|J|$]]

<h1>Ruby, 20 bytes</h1>

<pre><code>-&gt;n{n.min{|x|x.abs}}
</code></pre>

<p>Pretty straightforward solution. :)</p>


blocks|key|930557|text|Haskell，29字节|type|header-two|depth|inlineStyleRanges|entityRanges|data|930558|snd.maximum.map(\x->(-x%5E2,x))|code-block|syntax|javascript|930559|用法示例：snd.maximum.map(\x->(-x%5E2,x))+$+[1,-2,-8,4,5]->+1。|unstyled|offset|length|style|CODE|930560|将每个元素x映射到一对(-x%5E2,x)。找出最大值，从一对中挑选第二个元素。|entityMap^0|0|0|5|19|1H|1|0|5|1|B|8^^$0|@$1|2|3|4|5|6|7|Q|8|@]|9|@]|A|$]]|$1|B|3|C|5|D|7|R|8|@]|9|@]|A|$E|F]]|$1|G|3|H|5|I|7|S|8|@$J|T|K|U|L|M]|$J|V|K|W|L|M]]|9|@]|A|$]]|$1|N|3|O|5|I|7|X|8|@$J|Y|K|Z|L|M]|$J|10|K|11|L|M]]|9|@]|A|$]]]|P|$]]

<h2>Haskell, 29 bytes</h2>

<pre><code>snd.maximum.map(\x-&gt;(-x^2,x))
</code></pre>

<p>Usage example: <code>snd.maximum.map(\x-&gt;(-x^2,x)) $ [1,-2,-8,4,5]</code>-> <code>1</code>.</p>

<p>Map each element <code>x</code> to a pair <code>(-x^2,x)</code>. Find the maximum and pick the 2nd element from the pair.</p>


blocks|key|6358843|text|JavaScript+(Node.js)，30字节|type|header-two|depth|inlineStyleRanges|entityRanges|offset|length|data|6358844|a=>a.sort((a,b)=>a*a-a>b*b)[0]|code-block|syntax|javascript|6358845|在网上试试！|unstyled|entityMap|0|LINK|mutability|MUTABLE|url|https://nodejs.org/|1|https://tio.run/##y0osSyxOLsosKNHNy09J/Z@TWqKQpmD7P9HWLlGvOL@oREMjUSdJE8jTStRNtEvSStKMNoj9n5yfV5yfk6qXk5@ukaYRbaijoGsExBY6CiY6CqaxmppcaCp0jcyNgZLGWKRMgRpNsGkxxW4USD1I/D8A^0|0|K|0|0|0|0|6|1^^$0|@$1|2|3|4|5|6|7|U|8|@]|9|@$A|V|B|W|1|X]]|C|$]]|$1|D|3|E|5|F|7|Y|8|@]|9|@]|C|$G|H]]|$1|I|3|J|5|K|7|Z|8|@]|9|@$A|10|B|11|1|12]]|C|$]]]|L|$M|$5|N|O|P|C|$Q|R]]|S|$5|N|O|P|C|$Q|T]]]]

<h1><a href="https://nodejs.org" rel="nofollow noreferrer">JavaScript (Node.js)</a>, 30 bytes</h1>



<pre class="lang-javascript prettyprint-override"><code>a=&gt;a.sort((a,b)=&gt;a*a-a&gt;b*b)[0]
</code></pre>

<p><a href="https://tio.run/##y0osSyxOLsosKNHNy09J/Z@TWqKQpmD7P9HWLlGvOL@oREMjUSdJE8jTStRNtEvSStKMNoj9n5yfV5yfk6qXk5@ukaYRbaijoGsExBY6CiY6CqaxmppcaCp0jcyNgZLGWKRMgRpNsGkxxW4USD1I/D8A" rel="nofollow noreferrer" title="JavaScript (Node.js) – Try It Online">Try it online!</a></p>


blocks|key|6358958|text|八度，28字节|type|header-two|depth|inlineStyleRanges|entityRanges|offset|length|data|6358959|@(x)max(x(min(a=abs(x))==a))|code-block|syntax|javascript|6358960|在网上试试！|unstyled|6358961|查找最小绝对值(min(a=abs(x)))，然后将其映射回在领带(x(...==a))情况下具有最小绝对值的元素。最后，取结果的最大值(max(...))来保证在一个领带的情况下，我们得到一个正的结果。|style|CODE|entityMap|0|LINK|mutability|MUTABLE|url|https://www.gnu.org/software/octave/|1|https://tio.run/##y08uSSxL/Z9mq6en999Bo0IzN7FCo0IjNzNPI9E2MakYKKJpa5uoqfk/TSNawVBB10hB10LBRME0VvM/AA^0|0|2|0|0|0|0|6|1|0|8|D|Y|9|1X|8^^$0|@$1|2|3|4|5|6|7|Y|8|@]|9|@$A|Z|B|10|1|11]]|C|$]]|$1|D|3|E|5|F|7|12|8|@]|9|@]|C|$G|H]]|$1|I|3|J|5|K|7|13|8|@]|9|@$A|14|B|15|1|16]]|C|$]]|$1|L|3|M|5|K|7|17|8|@$A|18|B|19|N|O]|$A|1A|B|1B|N|O]|$A|1C|B|1D|N|O]]|9|@]|C|$]]]|P|$Q|$5|R|S|T|C|$U|V]]|W|$5|R|S|T|C|$U|X]]]]

<h1><a href="https://www.gnu.org/software/octave/" rel="nofollow noreferrer">Octave</a>, 28 bytes</h1>



<pre class="lang-matlab prettyprint-override"><code>@(x)max(x(min(a=abs(x))==a))
</code></pre>

<p><a href="https://tio.run/##y08uSSxL/Z9mq6en999Bo0IzN7FCo0IjNzNPI9E2MakYKKJpa5uoqfk/TSNawVBB10hB10LBRME0VvM/AA" rel="nofollow noreferrer" title="Octave – Try It Online">Try it online!</a></p>

<p>Finds the smallest absolute value (<code>min(a=abs(x))</code>), then maps it back to which elements have that smallest absolute value in case of a tie (<code>x(...==a)</code>). Finally takes the maximum value of the results (<code>max(...)</code>) to ensure that in the event of a tie we get one result which is the positive one.</p>


blocks|key|931439|text|朱莉娅0.6，29字节|type|header-two|depth|inlineStyleRanges|entityRanges|offset|length|data|931440|x->sort(x,by=x->abs(x-.1))[1]|code-block|syntax|javascript|931441|按绝对值对温度进行排序，但先减去.1，以确保温度始终为正。|unstyled|931442|在网上试试！|entityMap|0|LINK|mutability|MUTABLE|url|http://julialang.org/|1|https://tio.run/##yyrNyUw0@59mm5Sanpn3v0LXrji/qESjQiep0hbISUwq1qjQ1TPU1Iw2jP2fmpfC5VCckV@ukKYRbaRjrGMSq4kmoKNrhCwGE/kPAA^0|0|6|0|0|0|0|0|6|1^^$0|@$1|2|3|4|5|6|7|W|8|@]|9|@$A|X|B|Y|1|Z]]|C|$]]|$1|D|3|E|5|F|7|10|8|@]|9|@]|C|$G|H]]|$1|I|3|J|5|K|7|11|8|@]|9|@]|C|$]]|$1|L|3|M|5|K|7|12|8|@]|9|@$A|13|B|14|1|15]]|C|$]]]|N|$O|$5|P|Q|R|C|$S|T]]|U|$5|P|Q|R|C|$S|V]]]]

<h1><a href="http://julialang.org/" rel="nofollow noreferrer">Julia 0.6</a>, 29 bytes</h1>



<pre class="lang-julia prettyprint-override"><code>x-&gt;sort(x,by=x-&gt;abs(x-.1))[1]
</code></pre>

<p>Sort by the absolute value of the temperature, but subtract .1 first to ensure positive temperatures always win.</p>

<p><a href="https://tio.run/##yyrNyUw0@59mm5Sanpn3v0LXrji/qESjQiep0hbISUwq1qjQ1TPU1Iw2jP2fmpfC5VCckV@ukKYRbaRjrGMSq4kmoKNrhCwGE/kPAA" rel="nofollow noreferrer" title="Julia 0.6 – Try It Online">Try it online!</a></p>


blocks|key|6358425|text|Python，62字节|type|header-two|depth|inlineStyleRanges|entityRanges|data|6358426|def+f(n):
++++r=min(map(abs,n))
++++return+r+if+r+in+n+else+-r|code-block|syntax|javascript|6358427|感觉有一个更简单/更短的解决方案。|unstyled|entityMap^0|0|0^^$0|@$1|2|3|4|5|6|7|K|8|@]|9|@]|A|$]]|$1|B|3|C|5|D|7|L|8|@]|9|@]|A|$E|F]]|$1|G|3|H|5|I|7|M|8|@]|9|@]|A|$]]]|J|$]]

<h1>Python, 62 bytes</h1>

<pre><code>def f(n):
    r=min(map(abs,n))
    return r if r in n else -r
</code></pre>

<p>It feels like there is a much simpler/shorter solution.</p>


blocks|key|6358449|text|Perl+6，15字节|type|header-two|depth|inlineStyleRanges|entityRanges|offset|length|data|6358450|*.min:{.²,-$_}|code-block|syntax|javascript|6358451|在网上试试！|unstyled|entityMap|0|LINK|mutability|MUTABLE|url|https://github.com/nxadm/rakudo-pkg|1|https://tio.run/##K0gtyjH7n1upoJamYPtfSy83M8@qWu/QJh1dlfja/9ZcxYmVCmkaKvGaCmn5RVwahjq6Rjq6FjomOqaaOlwaRgiujq4hSEQXSYWOoab1fwA^0|0|6|0|0|0|0|6|1^^$0|@$1|2|3|4|5|6|7|U|8|@]|9|@$A|V|B|W|1|X]]|C|$]]|$1|D|3|E|5|F|7|Y|8|@]|9|@]|C|$G|H]]|$1|I|3|J|5|K|7|Z|8|@]|9|@$A|10|B|11|1|12]]|C|$]]]|L|$M|$5|N|O|P|C|$Q|R]]|S|$5|N|O|P|C|$Q|T]]]]

<h1><a href="https://github.com/nxadm/rakudo-pkg" rel="nofollow noreferrer">Perl 6</a>, 15 bytes</h1>



<pre class="lang-perl6 prettyprint-override"><code>*.min:{.²,-$_}
</code></pre>

<p><a href="https://tio.run/##K0gtyjH7n1upoJamYPtfSy83M8@qWu/QJh1dlfja/9ZcxYmVCmkaKvGaCmn5RVwahjq6Rjq6FjomOqaaOlwaRgiujq4hSEQXSYWOoab1fwA" rel="nofollow noreferrer" title="Perl 6 – Try It Online">Try it online!</a></p>


blocks|key|930860|text|C+(clang)，74字节|type|header-two|depth|inlineStyleRanges|entityRanges|offset|length|data|930861|k,m;f(*i,n){for(k=*i;--n>0;k=(k*k>m*m%7C%7C(k==-m&&k<m))?m:k)m=i[n];return+k;}|code-block|syntax|javascript|930862|在网上试试！|unstyled|entityMap|0|LINK|mutability|MUTABLE|url|http://clang.llvm.org/|1|https://tio.run/##RY5RS8QwEITf8yuWOzyyJdF6KIi51B9S@xDaRJc0W8n1HrTX314jiMI8zCwfO9PrfnT8tu2J@/EyeDid54Gm2/dmiyqZICtSjEuYsoy2IqM1N7WJVsYqNqlK12u5W50Oh3hKiC/pOWKy1HJnsp8vmSGadRP7wQdiDy5n9zl6lg5ByjN9@SkUj3d/vq07RBSCeIbkiCXCIgT8RGo7sLDoewVF@qigSD8peFDwuJpCfeTCBbm7GV55pyBIUv@VVP4W6HdWbcS6fQM^0|0|9|0|0|0|0|6|1^^$0|@$1|2|3|4|5|6|7|U|8|@]|9|@$A|V|B|W|1|X]]|C|$]]|$1|D|3|E|5|F|7|Y|8|@]|9|@]|C|$G|H]]|$1|I|3|J|5|K|7|Z|8|@]|9|@$A|10|B|11|1|12]]|C|$]]]|L|$M|$5|N|O|P|C|$Q|R]]|S|$5|N|O|P|C|$Q|T]]]]

<h1><a href="http://clang.llvm.org/" rel="nofollow noreferrer">C (clang)</a>, 74 bytes</h1>



<pre class="lang-c prettyprint-override"><code>k,m;f(*i,n){for(k=*i;--n&gt;0;k=(k*k&gt;m*m||(k==-m&amp;&amp;k&lt;m))?m:k)m=i[n];return k;}
</code></pre>

<p><a href="https://tio.run/##RY5RS8QwEITf8yuWOzyyJdF6KIi51B9S@xDaRJc0W8n1HrTX314jiMI8zCwfO9PrfnT8tu2J@/EyeDid54Gm2/dmiyqZICtSjEuYsoy2IqM1N7WJVsYqNqlK12u5W50Oh3hKiC/pOWKy1HJnsp8vmSGadRP7wQdiDy5n9zl6lg5ByjN9@SkUj3d/vq07RBSCeIbkiCXCIgT8RGo7sLDoewVF@qigSD8peFDwuJpCfeTCBbm7GV55pyBIUv@VVP4W6HdWbcS6fQM" rel="nofollow noreferrer" title="C (clang) – Try It Online">Try it online!</a></p>


blocks|key|6358536|text|斯塔克斯，6+字节数|type|header-two|depth|inlineStyleRanges|entityRanges|offset|length|data|6358537|¢M║⌠§☺|code-block|syntax|javascript|6358538|在staxlang.xyz上运行并调试它！|unstyled|6358539|解压缩(6个字节)和解释|6358540|{%7Ca}eoH
{++}e++++++Get+all+elements+of+array+producing+the+minimum+value+from+a+block.
+%7Ca++++++++++Absolute+value.
+++++o+++++Sort+ascending.
++++++H++++Take+last.+Implicit+print.|entityMap|0|LINK|mutability|MUTABLE|url|https://github.com/tomtheisen/stax|1|https://github.com/tomtheisen/stax/blob/master/docs/packed.md#packed-stax|2|https://staxlang.xyz/#p=9b4dbaf41501&i=[-4%2B5%2B4%2B-1%2B6%2B-8%2B1]&a=1^0|0|4|0|7|3|1|0|0|0|L|2|0|0^^$0|@$1|2|3|4|5|6|7|10|8|@]|9|@$A|11|B|12|1|13]|$A|14|B|15|1|16]]|C|$]]|$1|D|3|E|5|F|7|17|8|@]|9|@]|C|$G|H]]|$1|I|3|J|5|K|7|18|8|@]|9|@$A|19|B|1A|1|1B]]|C|$]]|$1|L|3|M|5|6|7|1C|8|@]|9|@]|C|$]]|$1|N|3|O|5|F|7|1D|8|@]|9|@]|C|$G|H]]]|P|$Q|$5|R|S|T|C|$U|V]]|W|$5|R|S|T|C|$U|X]]|Y|$5|R|S|T|C|$U|Z]]]]

<h1><a href="https://github.com/tomtheisen/stax" rel="nofollow noreferrer">Stax</a>, 6 <a href="https://github.com/tomtheisen/stax/blob/master/docs/packed.md#packed-stax" rel="nofollow noreferrer">bytes</a></h1>

<pre><code>¢M║⌠§☺
</code></pre>

<p><a href="https://staxlang.xyz/#p=9b4dbaf41501&amp;i=[-4+5+4+-1+6+-8+1]&amp;a=1" rel="nofollow noreferrer">Run and debug it at staxlang.xyz!</a></p>

<h3>Unpacked (6 bytes) and explanation</h3>

<pre><code>{|a}eoH
{  }e      Get all elements of array producing the minimum value from a block.
 |a          Absolute value.
     o     Sort ascending.
      H    Take last. Implicit print.
</code></pre>


blocks|key|930964|text|Pyth，4字节|type|header-two|depth|inlineStyleRanges|entityRanges|data|930965|.m.a|code-block|syntax|javascript|930966|在网上试试！|unstyled|offset|length|930967|解释：|930968|.m.a+++#Code
.m.abQ+#With+implicit+variables
.m+++Q+#Filter+input+list+for+values+b+with+minimal+value+of+the+following:
++.ab++#Absolute+value+of+b|entityMap|0|LINK|mutability|MUTABLE|url|https://tio.run/##K6gsyfj/Xy9XL/H//2hDHV0jHV0LHVMdk1gA^0|0|0|0|6|0|0|0^^$0|@$1|2|3|4|5|6|7|W|8|@]|9|@]|A|$]]|$1|B|3|C|5|D|7|X|8|@]|9|@]|A|$E|F]]|$1|G|3|H|5|I|7|Y|8|@]|9|@$J|Z|K|10|1|11]]|A|$]]|$1|L|3|M|5|I|7|12|8|@]|9|@]|A|$]]|$1|N|3|O|5|D|7|13|8|@]|9|@]|A|$E|F]]]|P|$Q|$5|R|S|T|A|$U|V]]]]

<h1>Pyth, 4 bytes</h1>
<pre><code>.m.a
</code></pre>
<p><a href="https://tio.run/##K6gsyfj/Xy9XL/H//2hDHV0jHV0LHVMdk1gA" rel="nofollow noreferrer">Try it online!</a></p>
Explanation:
<pre><code>.m.a   #Code
.m.abQ #With implicit variables
.m   Q #Filter input list for values b with minimal value of the following:
  .ab  #Absolute value of b
</code></pre>


blocks|key|6358630|text|Python+3，31字节|type|header-two|depth|inlineStyleRanges|entityRanges|offset|length|data|6358631|a=lambda+q:sorted(q,key=abs)[0]|code-block|syntax|javascript|6358632|在网上试试！|unstyled|6358633|按绝对值对项目进行排序，并打印第一个元素。|entityMap|0|LINK|mutability|MUTABLE|url|https://docs.python.org/3/|1|https://tio.run/##K6gsycjPM/7/P9E2JzE3KSVRodCqOL@oJDVFo1AnO7XSNjGpWDPaIPb/fwA^0|0|8|0|0|0|0|6|1|0^^$0|@$1|2|3|4|5|6|7|W|8|@]|9|@$A|X|B|Y|1|Z]]|C|$]]|$1|D|3|E|5|F|7|10|8|@]|9|@]|C|$G|H]]|$1|I|3|J|5|K|7|11|8|@]|9|@$A|12|B|13|1|14]]|C|$]]|$1|L|3|M|5|K|7|15|8|@]|9|@]|C|$]]]|N|$O|$5|P|Q|R|C|$S|T]]|U|$5|P|Q|R|C|$S|V]]]]

<h1><a href="https://docs.python.org/3/" rel="nofollow noreferrer">Python 3</a>, 31 bytes</h1>



<pre class="lang-python prettyprint-override"><code>a=lambda q:sorted(q,key=abs)[0]
</code></pre>

<p><a href="https://tio.run/##K6gsycjPM/7/P9E2JzE3KSVRodCqOL@oJDVFo1AnO7XSNjGpWDPaIPb/fwA" rel="nofollow noreferrer" title="Python 3 – Try It Online">Try it online!</a></p>

<p>Sorts items by absolute value and prints the first element.</p>


blocks|key|6358795|text|SmileBASIC，56字节|type|header-two|depth|inlineStyleRanges|entityRanges|data|6358796|DEF+Z+N,T
RSORT+T
DIM+V[N]ARYOP+2,V,T,T
SORT+V,T?T[0]END|code-block|syntax|javascript|6358797|首先，对输入列表进行排序，因此，如果有平分，则选择正温度。然后每个温度被平方并存储在另一个数组中。原始数组按此数组排序，并打印第一项。|unstyled|entityMap^0|0|0^^$0|@$1|2|3|4|5|6|7|K|8|@]|9|@]|A|$]]|$1|B|3|C|5|D|7|L|8|@]|9|@]|A|$E|F]]|$1|G|3|H|5|I|7|M|8|@]|9|@]|A|$]]]|J|$]]

<h1>SmileBASIC, 56 bytes</h1>
<pre><code>DEF Z N,T
RSORT T
DIM V[N]ARYOP 2,V,T,T
SORT V,T?T[0]END
</code></pre>
<p>First, the input list is sorted, so the positive temperature will be chosen if there's a tie. Then each temperature is squared and stored in another array. The original array is sorted by this array, and the first item is printed.</p>


blocks|key|931327|text|起效，88字节|type|header-two|depth|inlineStyleRanges|entityRanges|offset|length|data|931328|Method"f_«_»"is[c:[1..∞),t:integer*%7Cquicksort+a,b+in+t[1..c]+by[%7Ca-0.1%7C<%7Cb-0.1%7C][1]]|code-block|syntax|javascript|931329|近似的混淆：|unstyled|931330|Method+"nearest+to+zero+among+first+_+of+«_»"+is
[
++++count+:+natural+number,
++++temps+:+integer*
%7C
++++(quicksort+a,+b+in+temps[1..count]+by+[%7Ca-0.1%7C+<+%7Cb-0.1%7C])[1]
]|931331|方法名为模式语法的f_«_»将将初始计数读取为自然数(其类型在上文缩写为范围类型[1..∞))，与所收集的后续整数的元组分开。|style|CODE|931332|身体剩下的只有按自定义比较器排序了。在这里，我们避免了在x和-x之间进行二级比较的需要，方法是将值稍微移到-∞上。|entityMap|0|LINK|mutability|MUTABLE|url|http://www.availlang.org/|1|http://www.availlang.org/about-avail/learn/quick-start.html#methods-message-pattern-language|2|http://www.availlang.org/about-avail/documentation/stacks/library-documentation/avail/Avail/Foundation/Tuples/2169357673.html^0|0|2|0|0|0|0|0|9|5|14|6|4|4|1|0|S|1|U|2|7|9|2^^$0|@$1|2|3|4|5|6|7|14|8|@]|9|@$A|15|B|16|1|17]]|C|$]]|$1|D|3|E|5|F|7|18|8|@]|9|@]|C|$G|H]]|$1|I|3|J|5|K|7|19|8|@]|9|@]|C|$]]|$1|L|3|M|5|F|7|1A|8|@]|9|@]|C|$G|H]]|$1|N|3|O|5|K|7|1B|8|@$A|1C|B|1D|P|Q]|$A|1E|B|1F|P|Q]]|9|@$A|1G|B|1H|1|1I]]|C|$]]|$1|R|3|S|5|K|7|1J|8|@$A|1K|B|1L|P|Q]|$A|1M|B|1N|P|Q]]|9|@$A|1O|B|1P|1|1Q]]|C|$]]]|T|$U|$5|V|W|X|C|$Y|Z]]|10|$5|V|W|X|C|$Y|11]]|12|$5|V|W|X|C|$Y|13]]]]

<h1><a href="http://www.availlang.org/" rel="nofollow noreferrer">Avail</a>, 88 bytes</h1>

<pre><code>Method"f_«_»"is[c:[1..∞),t:integer*|quicksort a,b in t[1..c] by[|a-0.1|&lt;|b-0.1|][1]]
</code></pre>

<p>Approximate deobfuscation:</p>

<pre><code>Method "nearest to zero among first _ of «_»" is
[
    count : natural number,
    temps : integer*
|
    (quicksort a, b in temps[1..count] by [|a-0.1| &lt; |b-0.1|])[1]
]
</code></pre>

<p>The <a href="http://www.availlang.org/about-avail/learn/quick-start.html#methods-message-pattern-language" rel="nofollow noreferrer">pattern syntax</a> in the method's name, <code>f_«_»</code>, will read the initial count as a natural number (whose type is abbreviated above as the range type <code>[1..∞)</code>) separate from the collected tuple of subsequent integers.</p>

<p>All that remains for the body is to <a href="http://www.availlang.org/about-avail/documentation/stacks/library-documentation/avail/Avail/Foundation/Tuples/2169357673.html" rel="nofollow noreferrer">sort by a custom comparator</a>. Here we escape the need for a second-level comparison between <code>x</code> and <code>-x</code> by shifting the values slightly towards -∞.</p>


blocks|key|931480|text|八度，19字节|type|header-two|depth|inlineStyleRanges|entityRanges|offset|length|data|931481|@(x)min(complex(x))|code-block|syntax|javascript|931482|在网上试试！|unstyled|931483|这利用了一个事实，即具有复杂输入的min按绝对值进行比较，然后按角度进行比较：|style|CODE|931484|对于复杂参数，使用元素的大小进行比较。如果震级相同，则根据相位角(-pi，pi)对结果进行排序。|blockquote|entityMap|0|LINK|mutability|MUTABLE|url|https://www.gnu.org/software/octave/|1|https://tio.run/##y08uSSxL/Z9mq6en999Bo0IzNzNPIzk/tyAntQLI0/yfphGta6hgqKBrpKBroWCiYBqr@R8A|2|https://octave.sourceforge.io/octave/function/min.html^0|0|2|0|0|0|0|6|1|0|H|3|H|3|2|0^^$0|@$1|2|3|4|5|6|7|13|8|@]|9|@$A|14|B|15|1|16]]|C|$]]|$1|D|3|E|5|F|7|17|8|@]|9|@]|C|$G|H]]|$1|I|3|J|5|K|7|18|8|@]|9|@$A|19|B|1A|1|1B]]|C|$]]|$1|L|3|M|5|K|7|1C|8|@$A|1D|B|1E|N|O]]|9|@$A|1F|B|1G|1|1H]]|C|$]]|$1|P|3|Q|5|R|7|1I|8|@]|9|@]|C|$]]]|S|$T|$5|U|V|W|C|$X|Y]]|Z|$5|U|V|W|C|$X|10]]|11|$5|U|V|W|C|$X|12]]]]

<h1><a href="https://www.gnu.org/software/octave/" rel="nofollow noreferrer">Octave</a>, 19 bytes</h1>



<pre class="lang-matlab prettyprint-override"><code>@(x)min(complex(x))
</code></pre>

<p><a href="https://tio.run/##y08uSSxL/Z9mq6en999Bo0IzNzNPIzk/tyAntQLI0/yfphGta6hgqKBrpKBroWCiYBqr@R8A" rel="nofollow noreferrer" title="Octave – Try It Online"><strong>Try it online!</strong></a></p>

<p>This exploits the fact that <a href="https://octave.sourceforge.io/octave/function/min.html" rel="nofollow noreferrer"><code>min</code></a> with complex input compares by absolute value, then by angle:</p>

<blockquote>
  <p>For complex arguments, the magnitude of the elements are used for comparison. If the magnitudes are identical, then the results are ordered by phase angle in the range (-pi, pi].</p>
</blockquote>


blocks|key|931506|text|C#，171个字节|type|header-two|depth|inlineStyleRanges|entityRanges|data|931507|using+static+System.Console;using+System.Linq;class+s{static+void+Main()=>Write(ReadLine()=="0"?0:ReadLine().Split('+').Select(int.Parse).OrderBy(v=>v*(.1-v)).Last());}|code-block|syntax|javascript|931508|在网上试试！|unstyled|offset|length|entityMap|0|LINK|mutability|MUTABLE|url|https://tio.run/##RcpBC4IwGMbxe5/ixYtbsKGREIkGdTWKPHQe8yUGNmvvGkj02ZeQ0O3h9/w1CT04jPFFxt6AvPJGQzuSx7s8DJaGHsvfN2Nj7LPUvSICes99GEwHR2Us41V9dcYju6DqphQnqZIs2WXbv8j20RvPUkiniT1qz4z18qwcIZcn16HbjyxUdVgymYvAuWwUecZ5@YmxWOQgViA2sIbiCw^0|0|0|0|6|0^^$0|@$1|2|3|4|5|6|7|S|8|@]|9|@]|A|$]]|$1|B|3|C|5|D|7|T|8|@]|9|@]|A|$E|F]]|$1|G|3|H|5|I|7|U|8|@]|9|@$J|V|K|W|1|X]]|A|$]]]|L|$M|$5|N|O|P|A|$Q|R]]]]

<h1>C#, 171 bytes</h1>

<pre class="lang-cs prettyprint-override"><code>using static System.Console;using System.Linq;class s{static void Main()=&gt;Write(ReadLine()=="0"?0:ReadLine().Split(' ').Select(int.Parse).OrderBy(v=&gt;v*(.1-v)).Last());}
</code></pre>

<p><a href="https://tio.run/##RcpBC4IwGMbxe5/ixYtbsKGREIkGdTWKPHQe8yUGNmvvGkj02ZeQ0O3h9/w1CT04jPFFxt6AvPJGQzuSx7s8DJaGHsvfN2Nj7LPUvSICes99GEwHR2Us41V9dcYju6DqphQnqZIs2WXbv8j20RvPUkiniT1qz4z18qwcIZcn16HbjyxUdVgymYvAuWwUecZ5@YmxWOQgViA2sIbiCw" rel="nofollow noreferrer" title="C# (.NET Core) – Try It Online">Try it online!</a></p>


blocks|key|931655|text|05AB1E，5+字节数|type|header-two|depth|inlineStyleRanges|entityRanges|offset|length|data|931656|{R0.x|code-block|syntax|javascript|931657|在网上试试。|unstyled|931658|或者另一种选择：|931659|ÄWQÏà|931660|931661|解释：|931662|{++++++#+Sort+the+(implicit)+input-list+lowest-to-highest
+R+++++#+Reverse+it+to+highest-to-lowest
++0.x++#+Pop+and+push+the+item+closest+to+0
+++++++#+(after+which+the+result+is+output+implicitly)

Ä++++++#+Get+the+absolute+value+of+each+in+the+(implicit)+input-list
+W+++++#+Push+the+minimum+(without+popping+the+list)
++Q++++#+Check+which+are+equal+to+this+minimum
+++Ï+++#+Only+keep+the+values+in+the+(implicit)+input-list+at+the+truthy+indices
++++à++#+Pop+and+push+the+maximum+of+the+remaining+values
+++++++#+(after+which+the+result+is+output+implicitly)|entityMap|0|LINK|mutability|MUTABLE|url|https://github.com/Adriandmen/05AB1E/wiki/Commands|1|https://github.com/Adriandmen/05AB1E/wiki/Codepage|2|https://tio.run/##yy9OTMpM/f@/OshAr@L//2hDHV0jHV0LHRMd01gA|3|https://tio.run/##yy9OTMpM/f//cEt44OH@wwv@/4821NE10tG10DHRMY0FAA^0|0|6|0|9|3|1|0|0|0|6|2|0|0|0|0|6|3|0|0^^$0|@$1|2|3|4|5|6|7|17|8|@]|9|@$A|18|B|19|1|1A]|$A|1B|B|1C|1|1D]]|C|$]]|$1|D|3|E|5|F|7|1E|8|@]|9|@]|C|$G|H]]|$1|I|3|J|5|K|7|1F|8|@]|9|@$A|1G|B|1H|1|1I]]|C|$]]|$1|L|3|M|5|K|7|1J|8|@]|9|@]|C|$]]|$1|N|3|O|5|F|7|1K|8|@]|9|@]|C|$G|H]]|$1|P|3|J|5|K|7|1L|8|@]|9|@$A|1M|B|1N|1|1O]]|C|$]]|$1|Q|3|R|5|6|7|1P|8|@]|9|@]|C|$]]|$1|S|3|T|5|F|7|1Q|8|@]|9|@]|C|$G|H]]]|U|$V|$5|W|X|Y|C|$Z|10]]|11|$5|W|X|Y|C|$Z|12]]|13|$5|W|X|Y|C|$Z|14]]|15|$5|W|X|Y|C|$Z|16]]]]

<h1><a href="https://github.com/Adriandmen/05AB1E/wiki/Commands" rel="nofollow noreferrer">05AB1E</a>, 5 <a href="https://github.com/Adriandmen/05AB1E/wiki/Codepage" rel="nofollow noreferrer">bytes</a></h1>
<pre><code>{R0.x
</code></pre>
<p><a href="https://tio.run/##yy9OTMpM/f@/OshAr@L//2hDHV0jHV0LHRMd01gA" rel="nofollow noreferrer">Try it online.</a></p>
<p>Or alternatively:</p>
<pre><code>ÄWQÏà
</code></pre>
<p><a href="https://tio.run/##yy9OTMpM/f//cEt44OH@wwv@/4821NE10tG10DHRMY0FAA" rel="nofollow noreferrer">Try it online.</a></p>
<p><strong>Explanation:</strong></p>

<pre class="lang-python prettyprint-override"><code>{      # Sort the (implicit) input-list lowest-to-highest
 R     # Reverse it to highest-to-lowest
  0.x  # Pop and push the item closest to 0
       # (after which the result is output implicitly)

Ä      # Get the absolute value of each in the (implicit) input-list
 W     # Push the minimum (without popping the list)
  Q    # Check which are equal to this minimum
   Ï   # Only keep the values in the (implicit) input-list at the truthy indices
    à  # Pop and push the maximum of the remaining values
       # (after which the result is output implicitly)
</code></pre>


<p>In this exercise, you have to analyze records of temperature to find the closest to zero.</p>

<p>Write a program that prints the temperature closest to 0 among input data.</p>

<h2>Input</h2>

<ul>
<li>N, the number of temperatures to analyse (optional). This will be nonzero.</li>
<li>The N temperatures expressed as integers ranging from <em>-273 to 5526</em>.</li>
</ul>

<h2>Output</h2>

<p>Output the temperature closest to 0. If two temperatures are equally close, take the positive one. For instance, if the temperatures are -5 and 5, output 5.</p>

<h2>Example</h2>

<pre><code>Input

    5
    1 -2 -8 4 5

Output

    1
</code></pre>

<p><a href="https://github.com/GlenDC/Codingame/blob/master/descriptions/temperatures.md" rel="nofollow noreferrer">This challenge is similar to this one on CodinGame, you can view the problem statement source here.</a>
Some modifications have been made to the text.</p>


Find the temperature closest to 0

翻译质量差，导致语言生硬或混乱。

没有提供实际的解决方法或示例。

解答不清晰，无法理解或解决问题。

页面排版不美观，阅读体验差。

文章

问答

视频

学习中心

腾讯云实验室

直播

竞赛

腾讯云代码分析专区

腾讯iOA零信任安全管理系统专区

腾讯云架构师技术同盟交流圈

腾讯云数据库专区

腾讯云顾问专区

腾讯云原生专区

腾讯混元专区

腾讯云TCE专区

腾讯云Lighthouse专区

腾讯云HAI专区

腾讯云Edgeone专区

腾讯云存储专区

腾讯云智能专区

腾讯轻联专区 

腾讯云开发专区

TAPD专区

腾讯轻量云游戏服专区

腾讯云最具价值专家

腾讯云架构师技术同盟

腾讯云创作之星

腾讯云开发者先锋

腾讯云代码助手

云原生构建

TAPD 敏捷项目管理

Cloud Studio

SDK中心

API中心

命令行工具

涵盖代码开发、场景应用、自动测试全流程，助你从零构建专属AI助手

一站式MCP教程库，解锁AI应用新玩法

在这个练习中，你必须分析温度的记录，才能找到最接近于零的温度。编写一个程序，输出输入数据中最接近0的温度。输入N，需要分析的温度数目(可选)。这将是非零。N温度以整数的形式表示，从-273到5526不等。输出输出最接近0的温度。如果两个温度相等，就取正温度。例如，如果温度是-5和5，输出5。示例Input    5    1 -2 -8 4 5Output    1此挑战与CodinGame上的问

问找到最接近0的温度
EN

输入

输出

示例

回答 25

Code Golf用户

JavaScript (ES6)，33字节

Demo

Code Golf用户

Python，35字节

Code Golf用户

果冻，4字节

是如何工作的

社区

活动

圈层

关于

腾讯云开发者

热门产品

热门推荐

更多推荐

问找到最接近0的温度EN

输入

输出

示例

回答 25

Code Golf用户

JavaScript (ES6)，33字节

Demo

Code Golf用户

Python，35字节

Code Golf用户

果冻，4字节

是如何工作的

社区

活动

圈层

关于

腾讯云开发者

热门产品

热门推荐

更多推荐

问找到最接近0的温度
EN