paste bin
Author
Language
C++
Plain text
Accesslog
Action script
Ada
Apache
Arduino
Armasm
Autohotkey
Awk
Bash
Basic
Brainfuck
C
Clojure
Cmake
C#
css
D
Delphi
Dockerfile
Erlang
Fortran
F#
Gauss
Go
Gradle
Graphql
Groovy
Haskell
Ini
Java
JavaScript
json
Julia
Kotlin
Lasso
LaTeX
Leaf
lisp
llvm
Lua
Makefile
Markdown
Mathematica
Matlab
Nginx
Objective-C
Ocaml
Oxygene
Perl
PgSQL
php
Powershell
Processing
Profile
Properties
Puppet
Purebasic
Python
Q
QML
R
Ruby
Rust
Scala
Scheme
Scilab
Shell
Smalltalk
SQL
Swift
Typescript
VB.NET
VB Script
Verilog
Vim
Wasm
x86asm
Xml
Xquery
Yaml
source code:
#include <cstdio> #include <numeric> using std::accumulate; #include <algorithm> using std::sort; int main(void) { int *a,N,i,res; while(scanf("%d",&N)!=EOF) { a=new int [N]; for(i=0;i<N;i++) scanf("%d",a+i); sort(a,a+N); res=accumulate(a,a+N-1,0); if(res<a[N-1]) printf("%.1f\n",(float)res); else printf("%.1f\n",(float)(res+a[N-1])/2); delete [] a; } return 0; }
comment: