Problem:


  MathJax.Hub.Config({ tex2jax: { inlineMath: [["$","$"], ["\\(","\\)"]], processEscapes: true }});

Min, Max and Sum

Write a program which reads a sequence of $n$ integers $a_i (i = 1, 2, ... n)$, and prints the minimum value, maximum value and sum of the sequence.

Input

  In the first line, an integer $n$ is given. In the next line, $n$ integers $a_i$ are given in a line.

Output

  Print the minimum value, maximum value and sum in a line. Put a single space between the values.

Constraints

$0 < n \leq 10000$

$-1000000 \leq a_i \leq 1000000$

Sample Input

5
10 1 5 4 17

Sample Output

1 17 37



Sample input:
5
10 1 5 4 17


Sample output:
1 17 37

Submission status: Accepted

Solution code:
n = int(input())
m = list(map(int, input().split()))
a = max(m)
b = min(m)
c = sum(m)
print(b, a, c)

Submission status: Accepted

Solution code:
n = int(input())
d = [int(s) for s in input().split()]

print(str(min(d)) + " " + str(max(d)) + " " + str(sum(d)))

Submission status: Accepted

Solution code:
n = int(input())
line = list(map(int, input().split()))
print(min(line), max(line), sum(line))

Submission status: Accepted

Solution code:
input()
li = list(map(int,input().split()))

print(f'{min(li)} {max(li)} {sum(li)}')

Submission status: Accepted

Solution code:
# 最初の行を捨てる
input()

val = list(map(int, input().split(" ")))

print(min(val), max(val), sum(val))

Submission status: Accepted

Solution code:
n = int(input())
A = list(map(int, input().split()))
print(min(A), max(A), sum(A))

Submission status: Accepted

Solution code:
# coding: utf-8
# Your code here!
n = int(input())
s = list(map(int,input().split()))

min_value = s[0]
max_value = s[0]
sum_value = 0

for i in s:
    sum_value += i
    if i < min_value:
        min_value = i
    if i > max_value:
        max_value = i
        
print(min_value, max_value, sum_value)

Submission status: Accepted

Solution code:
# coding: utf-8
n=int(input())
a=list(map(int, input().split()))
max=-1000000
min=1000000
sum=0
for i in range(n):
    if a[i]>max:
        max=a[i]
    if a[i]<min:
        min=a[i]
    sum+=a[i]
print("{} {} {}".format(min,max,sum))

Submission status: Accepted

Solution code:
n = int(input())
v = list(map(int,input().split()))
min, max, sum = v[0], v[0], 0
for i in v:
    if i<min:
        min = i
    if i>max:
        max = i
    sum += i
print (min, max, sum)

Submission status: Accepted

Solution code:
n = input()
l = list(map(int,input().split()))

a = max(l)
b = min(l)
c = sum(l)

print('{} {} {}'.format(b,a,c))

Submission status: Accepted

Solution code:
n = int(input())
value = input().split(" ")
a = [0] * n
    
for i in range(0, n):
    a[i] = int(value[i])

max = max(a)
min = min(a)
sum = 0

for i in range(0, n):
    sum = sum + a[i]


print("{0} {1} {2}".format(min, max , sum))

Submission status: Accepted

Solution code:
n=int(input())
data = list(map(int, input().split()))
vmin = min(data)
vmax = max(data)
vsum = sum(data)
print(vmin, vmax, vsum)

Submission status: Accepted

Solution code:
n=int(input())
a=list(map(int,input().split()))

max=min=0
total=a[0]
for i in range(n-1):
    if(a[i+1]>a[max]):
        max=i+1
    if(a[i+1]<a[min]):
        min=i+1
    total+=a[i+1]
print('%d %d %d' % (a[min],a[max],total))

Submission status: Accepted

Solution code:
_=input()
a=list(map(int,input().split()))
print("{} {} {}".format(min(a),max(a),sum(a)))

Submission status: Accepted

Solution code:
n = input()
a = input().split()
l = [int(i) for i in a]
a = min(l)
b = max(l)
c = sum(l)
print(a,b,c)

Submission status: Accepted

Solution code:
n = int(input())
list = input().split()
max = int(list[0])
min = int(list[0])
total = 0
for i in list:
    if max < int(i):
        max = int(i)
    if min > int(i):
        min = int(i)
    total += int(i)
print(min, max, total)

Submission status: Accepted

Solution code:
x = input()
nums = list(map(int,input().split()))
print(min(nums), max(nums), sum(nums))

Submission status: Accepted

Solution code:
a = int(input())
lt = list(map(int, input().split()))
print(str(min(lt)) + " " + str(max(lt)) + " " + str(sum(lt)))

Submission status: Accepted

Solution code:
big_num = 20000000000000
N = input()
table = list(map(int, input().split()))
MaxNum = -big_num
minNum = big_num
sum = 0
for i in table:
    if MaxNum < i:
        MaxNum = i
    if minNum > i:
        minNum = i
    sum += i
print("%d %d %d"%(minNum, MaxNum, sum))

Submission status: Accepted

Solution code:
num = int(input())
array = list(map(int, input().split()))
	
minimum = min(array)
maximum = max(array)
summation = sum(array)

print(minimum,maximum,summation)

Submission status: Accepted

Solution code:
n = int(input())
ns = list(map(int,input().split()))

print(min(ns), max(ns), sum(ns))

Submission status: Accepted

Solution code:

n = int(input())

a = list(map(int,input().split()))

amin = min(a)
amax = max(a)
asum = sum(a)

print(amin, amax, asum)

Submission status: Accepted

Solution code:
x=input()
l=list(map(int,input().split()))
print(min(l), max(l), sum(l))

Submission status: Accepted

Solution code:
L1=input()
n=int(L1)
L=input().split( )

j=1
max=int(L[0])
min=int(L[0])
sum=int(L[0])

while j<=n-1:
    sum=sum+int(L[j])
    if max<int(L[j]):
        max=int(L[j])
    if min>int(L[j]):
        min=int(L[j])
    j+=1

print(f"{min} {max} {sum}")

Submission status: Accepted

Solution code:
#from numpy import*
#from scipy import*
from collections import* #defaultdict Counter deque appendleft
from fractions import gcd
from functools import* #reduce
from itertools import* #permutations("AB",repeat=2) combinations("AB",2) product("AB",2) groupby
from operator import mul
from bisect import* #bisect_left bisect_right
from heapq import* #heapify heappop heappushpop
from math import factorial,pi
from copy import deepcopy
import sys
#input=sys.stdin.readline  #危険！基本オフにしろ！
sys.setrecursionlimit(10**6)


def main():
    n,*a=map(int,open(0).read().split())
    print(min(a),max(a),sum(a))
    
if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
input()
x = list([int(i) for i in input().split()])
print(min(x), max(x), sum(x))

Submission status: Accepted

Solution code:
n = int(input())
list_num = list(map(int, input().split()))


print(f"{min(list_num)} {max(list_num)} {sum(list_num)}")

Submission status: Accepted

Solution code:
input()
xs=sorted(map(int,input().split()))
print("{} {} {}".format(xs[0], xs[-1], sum(xs)))

Submission status: Accepted

Solution code:
int_list = [] 

n = input()
s = input()

for val in s.split():
    int_list.append(int(val))
    
print(min(int_list), max(int_list), sum(int_list))

Submission status: Accepted

Solution code:
int_list =[]

n = input ()
s = input ()

for val in s. split ():
    int_list.append(int(val))
    
print (min(int_list), max(int_list), sum(int_list))

Submission status: Accepted

Solution code:
int_list = []

n=input()
s=input()

for Val in s.split():
    int_list.append(int(Val))
    
print(min(int_list),max(int_list),sum(int_list))

Submission status: Accepted

Solution code:
int_list =[]
n = input()
s = input()
for val in s.split():
    int_list.append(int(val))
  
print(min(int_list), max(int_list), sum(int_list))

Submission status: Accepted

Solution code:
a = input()
b = input()

numbers = b.split(" ")


print (min(int(i) for i in numbers),max(int(i) for i in numbers),sum(int(i) for i in numbers))

Submission status: Accepted

Solution code:
n = map(int,input())
list = [int(i) for i in input().split()]
# list = [int(input()) for i in range(n)]
# list = [map(int, input().split())]
print(min(list), max(list), sum(list))

Submission status: Accepted

Solution code:
n = int(input())
a = [int(i) for i in input().split()]

print("%d %d %d" % (min(a), max(a), sum(a)))

Submission status: Accepted

Solution code:
n = int(input())
a = [int(x) for x in input().split()]
print("%d %d %d" %(min(a), max(a), sum(a)))

Submission status: Accepted

Solution code:
input();a=sorted(map(int,input().split()));print("{} {} {}".format(a[0],a[-1],sum(a)))

Submission status: Accepted

Solution code:
input_int = int(input())
list_val = list(map(int, input().split()))
list_outval = [sorted(list_val)[0], sorted(list_val)[-1], sum(list_val)]
print(" ".join(map(str, list_outval)))

Submission status: Accepted

Solution code:
n = int(input())
ns = input().split()
for i in range(len(ns)):
    ns[i]=int(ns[i])
Sum = sum(ns)
Min = min(ns)
Max = max(ns)
print(Min,Max,Sum)

Submission status: Accepted

Solution code:
n = int(input())
a = list(map(int, input().split()))
minimum = 1000001
maximum = -1000001
sum = 0
for i in range(n):
    if(a[i] < minimum):
        minimum = a[i]
    if(maximum < a[i]):
        maximum = a[i]
    sum += a[i]
print("%d %d %d" % (minimum, maximum, sum))

Submission status: Accepted

Solution code:
n = int(input())
lst = list(map(int,input().split()))
a = min(lst)   
b = max(lst)   
c = sum(lst)   
print(a,b,c)

Submission status: Accepted

Solution code:
n = int(input())
ns = list(map(int, input().split()))

a = min(ns)  
b = max(ns)   
c = sum(ns)   
print(a,b,c)

Submission status: Accepted

Solution code:
i = int(input())
data = list(map(int,input().split()))
min = min(data)
max = max(data)
sum = sum(data)
print(min, max,sum)

Submission status: Accepted

Solution code:
n=input()
lst=list(map(int,input().split()))
print(min(lst),max(lst),sum(lst))

Submission status: Accepted

Solution code:
input()
lst = list(map(int, input().split()))
print(f'{min(lst)} {max(lst)} {sum(lst)}')

Submission status: Accepted

Solution code:
num = int(input())
array = input().split()
min = 1000000
max = -1000000
sum = 0
for i in range(num):
    a = int(array[i])
    sum += a
    if a < min:
        min = a
    if a > max:
        max = a
print(min, max, sum)

Submission status: Accepted

Solution code:
N = int(input())
a = list(map(int, input().strip().split()))
print(min(a), end=" ")
print(max(a), end=" ")
print(sum(a))

Submission status: Accepted

Solution code:
n = int(input())
A = [int(c) for c in input().split()]

print(min(A), max(A), sum(A))

Submission status: Accepted

Solution code:
n = int(input())

a = input().split()

b = []*10
for i in a:
    b.append(int(i))

x = min(b)
y = max(b)
z = sum(b)

print(x, y, z)

Submission status: Accepted

Solution code:
x = int(input())
a = list(map(int, input().split()))
max = -1000000
min = 1000000
total = 0

for x in a:
  if max < x:
    max = x
  if min > x:
    min = x
  
  total = total + x
  
print(min, max, total)

Submission status: Accepted

Solution code:
n=int(input())
d=[int(x) for x in input().split()]
 
a=min(d)
b=max(d)
c=sum(d)
print(a,b,c)

Submission status: Accepted

Solution code:
n=int(input())
d=[int(x) for x in input().split()]

a=min(d)
b=max(d)
c=sum(d)
print(a,b,c)

Submission status: Accepted

Solution code:
n = int(input())
data = input().split()

for i in range(len(data)):
    data[i] = int(data[i])
    
print(min(data), max(data), sum(data))

Submission status: Accepted

Solution code:
n=int(input())
 
ns=input().split()
 
for i in range(len(ns)):
    ns[i]=int(ns[i])
 
asum=sum(ns)
amin=min(ns)
amax=max(ns)
 
print(amin,amax,asum)

Submission status: Accepted

Solution code:
n=int(input())

ns=input().split()

for i in range(len(ns)):
    ns[i]=int(ns[i])

asum=sum(ns)
amin=min(ns)
amax=max(ns)

print(amin,amax,asum)

Submission status: Accepted

Solution code:
n = int(input())
a = list(map(int,input().split()))
a_min = min(a)
a_max = max(a)
a_sum = sum(a)
print(a_min,a_max,a_sum)

Submission status: Accepted

Solution code:
n=int(input())
arr=list(map(int,input().split()))
min=10**10
max=-10**10
sum=0
for i in range(n):
  tmp=arr[i]
  sum+=tmp
  if tmp>max:
    max=tmp
  if tmp<min:
    min=tmp
print(min,max,sum)

Submission status: Accepted

Solution code:
n = int(input())

a = [int(x) for x in input().split()]

print(min(a),max(a),sum(a))

Submission status: Accepted

Solution code:
N = int(input())
A = list(map(int, input().split()))
print (min(A), max(A), sum(A))

Submission status: Accepted

Solution code:
n = int(input())
a = [int(x) for x in input().split()]

print("%d %d %d" %(min(a),max(a),sum(a)))

Submission status: Accepted

Solution code:
n=int(input())
a=[int(x) for x in input().split()]
print(min(a),max(a),sum(a))

Submission status: Accepted

Solution code:
n = int(input())
lst = [int(v) for v in input().split()]

print(min(lst), max(lst), sum(lst))

Submission status: Accepted

Solution code:
n = int(input())
x = input().split()
a = [int(i) for i in x]
ans = [str(i) for i in [min(a), max(a), sum(a)]]
print(' '.join(ans))

Submission status: Accepted

Solution code:
import math


def main():

    # 引数を受け取る
    count = input()
    num = [int(x) for x in input().split(' ')]

    print('{0} {1} {2}'.format(min(num), max(num), sum(num)))


if __name__ == "__main__":
    main()

Submission status: Accepted

Solution code:
num = int(input())

l = list(map(int,input().split()))

print("%d %d %d"%(min(l),max(l),sum(l)))

Submission status: Accepted

Solution code:
N=int(input())
L=list(map(int,input().split()))

print("{} {} {}".format(min(L),max(L),sum(L)))

Submission status: Accepted

Solution code:
if __name__ == '__main__':
	n = int(input())
	d = [int(x) for x in input().split()]
	d.sort()
	s = 0
	for i in d:
		s = s + i
	
	print("%d %d %d" % (d[0],d[-1],s))

Submission status: Accepted

Solution code:
n=int(input())
lst=input().split()
for i in range(n):
	lst[i]=int(lst[i])
print(min(lst),max(lst),sum(lst))

Submission status: Accepted

Solution code:
n = int(input())
a = list(map(int,input().split(" ")))

print('{} {} {}'.format(min(a),max(a),sum(a)))

Submission status: Accepted

Solution code:
###
### atcorder test program
###

### math class
class math:
    ### pi
    pi = 3.14159265358979323846264338

    ### GCD
    def gcd(self, a, b):
        if b == 0:
            return a
        return self.gcd(b, a%b)

math = math()

### input sample
#i = input()
#A, B, C = [x for x in i.split()]
#R = float(input())
#A = [int(x) for x in input().split()]

### output sample
#print("{0} {1} {2:.5f}".format(A//B, A%B, A/B))
#print("{0:.6f} {1:.6f}".format(R*R*math.pi,R*2*math.pi))

N = int(input())
mat = [int(w) for w in input().split()]

print(min(mat), max(mat), sum(mat))

Submission status: Accepted

Solution code:
n=int(input())
l=list(map(int,input().split()))

l_max=max(l)
l_min=min(l)
l_sum=0
for i in l:
	l_sum+=i
print(str(l_min)+' '+str(l_max)+' '+str(l_sum))

Submission status: Accepted

Solution code:
count = int(input())

line = list(map(int, input().split()))
a = min(line)
b = max(line)
c = sum(line)
print(a, b, c)

Submission status: Accepted

Solution code:
n=int(input())
list=list(map(int,input().split()))
a=min(list)
b=max(list)
c=sum(list)
print(a,b,c)

Submission status: Accepted

Solution code:
n = int(input())
li = [int(i) for i in input().split()]
print("{} {} {}".format(min(li),max(li),sum(li)))

Submission status: Accepted

Solution code:
BIGNUM=2000000000

n=int(input())
nums=list(map(int,input().split()))

max=-BIGNUM
min=BIGNUM
total=0

for x in nums:
    if x>max:
        max=x
    if x<min:
        min=x
    total += x

print(min,max,total)

Submission status: Accepted

Solution code:
n=input()
a=[int(i) for i in input().split()]
print(min(a),max(a),sum(a))

Submission status: Accepted

Solution code:
input()
a = list(map(int, input().split()))
print(f'{min(a)} {max(a)} {sum(a)}')

Submission status: Accepted

Solution code:
n=int(input())
ai=list(map(int, input().split()))
a=min(ai)
b=max(ai)
c=sum(ai)
print(a, b, c)

Submission status: Accepted

Solution code:
x = input()
y = input()

list = y.split()

list_i = [int(s) for s in list]

Min = min(list_i)
Max = max(list_i)
Sum = sum(list_i)

mi = str(Min)
ma = str(Max)
su = str(Sum)
sp = " "

ans = mi + sp + ma + sp + su
print(ans)

Submission status: Accepted

Solution code:
gomi = input()
l = list(map(int,input().split()))
print(min(l),max(l),sum(l))

Submission status: Accepted

Solution code:
input()
nums = list(map(int, input().split()))
print(min(nums), max(nums), sum(nums))

Submission status: Accepted

Solution code:
a = int(input())
b = list(map(int, input().split()))
print(min(b), max(b), sum(b))

Submission status: Accepted

Solution code:
n = int(input())
A = list(map(int, input().split()))

print(min(A), max(A), sum(A))

Submission status: Accepted

Solution code:
num = int(input())
numbers = [int(i) for i in input().split()]

min_num = min(numbers)
max_num = max(numbers)
sum_num = sum(numbers)

print(min_num, max_num, sum_num)

Submission status: Accepted

Solution code:
x = int(input())
lst = list(map(int,input().split()))
if len(lst) != x:
    print("1行目と２行目の要素の数が違います")
else:    
    print("{} {} {}".format(min(lst),max(lst),sum(lst)))

Submission status: Accepted

Solution code:
_ = int(input())
l = list(map(int,input().split()))
print(min(l),max(l),sum(l))

Submission status: Accepted

Solution code:
n = int(input())
ai = list(map(int, input().split()))
print(min(ai), max(ai), sum(ai))

Submission status: Accepted

Solution code:
n = int(input())
i = input()
a = [int(x) for x in i.split()]

print(min(a), max(a), sum(a))

Submission status: Accepted

Solution code:
N = int(input())
num = list(map(int,input().split()))

min = min(num)
max = max(num)
sum = sum(num)

print(min,max,sum)

Submission status: Accepted

Solution code:
n=int(input())
data=list(map(int,input().split()))

min=max=sum=data[0]
for i in range(1,n):
    if data[i]<min:
        min=data[i]
    if data[i]>max:
        max=data[i]
    
    sum+=data[i]


print(min,max,sum)

Submission status: Accepted

Solution code:
n = int(input())
m = list(map(int,input().split()))
minm,maxm,summ = m[0],m[0],0
for x in range(n):
    if m[x] < minm:
        minm = m[x]
    elif m[x] > maxm:
        maxm = m[x]
    summ = summ + m[x]
print(minm,maxm,summ)

Submission status: Accepted

Solution code:
# ITP1_4_D
# 最小値、最大値、合計値

input()
d = list(map(int, input().split()))
print("{} {} {}".format(min(d), max(d), sum(d)))

Submission status: Accepted

Solution code:
n = int(input())
a =[]
a = list(map(int,input().split()))
s = 0

a.sort()
for i in range(n):
    s+=a[i]
    
print(a[0],a[-1],s)

Submission status: Accepted

Solution code:
n = int(input())

ls = list(map(int , input().split()))

print(min(ls) , max(ls), sum(ls))

Submission status: Accepted

Solution code:
BIG_NUM = 2000000000
 
N = int(input())
 
table = list(map(int,input().split()))
 
maximum = -BIG_NUM
minimum = BIG_NUM
total = 0
 
for x in table:
    if maximum < x:
        maximum = x
    if minimum > x:
        minimum = x
    total += x
 
print("%d %d %d"%(minimum,maximum,total))

Submission status: Accepted

Solution code:
N = input()
i = input()
lst = list(map(int, i.split()))

print('{0} {1} {2}'.format(min(lst), max(lst), sum(lst)))

Submission status: Accepted

Solution code:
a=input()
num=list(map(int,input().split()))
print(min(num),max(num),sum(num))

Submission status: Accepted

Solution code:
n = int(input())

inputdata = []
inputdata = list(map(int, input().split()))

print("{0} {1} {2}".format(min(inputdata), max(inputdata), sum(inputdata)))

Submission status: Accepted

Solution code:
n=int(input())
a=list(map(int,input().split()))
a.sort()
print(a[0],a[n-1],sum(a))

Submission status: Accepted

Solution code:
n = int(input())
a = list(map(int, input().split()))
amin = min(a)
amax = max(a)
asum = sum(a)
print(amin, amax, asum)

Submission status: Accepted

Solution code:
n = int(input())
lst = input().split(' ')
lst = list(map(int, lst))
ma = max(lst)
mi = min(lst)
su = sum(lst)
print(mi, ma, su)

Submission status: Accepted

Solution code:
from functools import reduce
n = int(input())
values = list(map(int, input().split()))

def minNum(a,b):
    if a < b:
        return a
    return b 

def maxNum(a,b):
    if a < b:
        return b
    return a

def sumNum(a,b):
    return a + b

print(reduce(minNum, values, 1000001), reduce(maxNum, values, -1000001), reduce(sumNum, values, 0))

Submission status: Accepted

Solution code:
from functools import reduce

n = int(input())
values = list(map(int, list(input().split())))

def mymin(a, b):
    if a<b :
        return a
    else :
        return b

def mymax(a, b):
    if a>b :
        return a
    else :
        return b

def mysum(a, b):
    return a+b

print(reduce(mymin, values, 1000001), reduce(mymax, values, -1000001), reduce(mysum, values, 0))

Submission status: Accepted

Solution code:
from functools import reduce

def myMin(v1,v2):
    if v1 > v2:
        return v2
    return v1

def myMax(v1,v2):
    if v1 < v2:
        return v2
    return v1

def mySum(v1,v2):
    return v1 + v2

n = int(input())
values = list(map(int, list(input().split())))

print(reduce(myMin, values, 1000001), reduce(myMax, values, -1000001), reduce(mySum, values, 0))

Submission status: Accepted

Solution code:
from functools import reduce

n = int(input())
values = list(map(int, list(input().split())))

def mymin(a, b):
    if a < b:
        return a
    else:
        return b

def mymax(a, b):
    if b < a:
        return a
    else:
        return b

def mysum(a, b):
    return a + b

print(reduce(mymin, values), reduce(mymax, values), reduce(mysum, values))\

Submission status: Accepted

Solution code:
from functools import reduce

n = int(input())
values = list(map(int, list(input().split())))

def mymin(a, b):
    # ここに実装してください
    if a < b:
        return a
    else :
        return b

def mymax(a, b):
    # ここに実装してください
    if a < b:
        return b
    else :
        return a


def mysum(a, b):
    # ここに実装してください
    return a + b

print(reduce(mymin, values), reduce(mymax, values), reduce(mysum, values))

Submission status: Accepted

Solution code:
n = int(input())
values = list(map(int, list(input().split())))
print(min(values), max(values), sum(values))

def min(values):
    return min(values)
    
def min(values):
    return max(values)
    
def min(values):
    return sum(values)

Submission status: Accepted

Solution code:
from functools import reduce

n = int(input())
values = list(map(int, list(input().split())))


def mymin(a, b):
    if a < b:
        return a
    else:
        return b

def mymax(a, b):
    if a > b:
        return a
    else:
        return b

def mysum(a, b):
    return a + b

print(reduce(mymin, values, 1000001), reduce(mymax, values, -1000001), reduce(mysum, values, 0))

Submission status: Accepted

Solution code:
x = input()
x = int(x)
y = list(map(int, input().split()))

Max = y[0]
Min = y[0]
Sum = y[0]
for i in range((x-1)):
    if Max < y[(i+1)]:
        Max = y[(i+1)]
    if Min > y[(i+1)]:
        Min = y[(i+1)]
    Sum += y[(i+1)]
    
print(Min, Max, Sum)

Submission status: Accepted

Solution code:
input()
i = list(map(int,input().split()))
print(min(i),max(i),sum(i))

Submission status: Accepted

Solution code:
n=int(input())
ns=input().split()
for i in range(len(ns)):
    ns[i]=int(ns[i])
asum=sum(ns)
amin=min(ns,key=int)
amax=max(ns,key=int)
print(amin,amax,asum)

Submission status: Accepted

Solution code:
input()
n = [int(x) for x in input().split()]
print('{0} {1} {2}'.format(min(n), max(n), sum(n)))

Submission status: Accepted

Solution code:
min, max, sum = 1000000, -1000000, 0
n = input()
n = int(n)
string = input()
numbers = list(map(int, string.split(' ')))
for i in range(n):
    if numbers[i] < min:
        min = numbers[i]
    if numbers[i] > max:
        max = numbers[i]
    sum = sum + numbers[i]
print(min, max, sum)

Submission status: Accepted

Solution code:
n = int(input())
s = list(map(int, input().split()))

print (min(s),max(s),sum(s))

Submission status: Accepted

Solution code:
n = int(input())
x = input().rstrip().split()
x = [int(s) for s in x ]
print('{0} {1} {2}'.format(min(x),max(x),sum(x)))

Submission status: Accepted

Solution code:
n=int(input())
n_l=list(map(int,input().split()))
print(min(n_l),max(n_l),sum(n_l))

Submission status: Accepted

Solution code:
n = int(input())
arr = list(map(int ,input().split()))
n_sum = 0
for i in range(n):
        n_sum += arr[i]
n_max = arr[0]
n_min = arr[0]

for i in range(n):
        if n_max < arr[i]:
                n_max = arr[i]
        if n_min > arr[i]:
                n_min = arr[i]

print('%d %d %d' % (n_min, n_max, n_sum))

Submission status: Accepted

Solution code:
line = input()
linea = input().split(" ")
linea = [int(i) for i in linea]

linemin = min(linea)
linemax = max(linea)
linesum = sum(linea)

print(str(linemin) + " " + str(linemax) +" " + str(linesum))

Submission status: Accepted

Solution code:
int(input())
A = [int(_) for _ in input().split()]
print(min(A), max(A), sum(A))

Submission status: Accepted

Solution code:
n = int(input())
l = list(map(int, input().split()))

amin = min(l)
amax = max(l)
asum = sum(l)
print(amin, amax, asum)

Submission status: Accepted

Solution code:
_ = input()
li = list(map(int, input().split()))
print("{} {} {}".format(min(li), max(li), sum(li)))

Submission status: Accepted

Solution code:
x = int(input())
N = list(map(int,input().split()))
a = max(N)
b = min(N)
c = sum(N)
print("{0} {1} {2}".format(b,a,c))

Submission status: Accepted

Solution code:
n = int(input())
table = list(map(int,input().split()))
table.sort()
print(table[0],table[-1],sum(table))

Submission status: Accepted

Solution code:
N = int(input())
num = map(int, input().split())

sort_num = sorted(num)
print(sort_num[0], sort_num[N-1], sum(sort_num))

Submission status: Accepted

Solution code:
n = int(input())
nlist = list(map(int, input().split()))

nmin = min(nlist)
nmax = max(nlist)
nsum = sum(nlist)

print(nmin, nmax, nsum)

Submission status: Accepted

Solution code:
# coding: utf-8
num = int(input().rstrip())
ai = input().rstrip().split()
for i in range(len(ai)):
    ai[i] = int(ai[i])
print(str(min(ai)) + " " + str(max(ai)) + " " + str(sum(ai)))

Submission status: Accepted

Solution code:
z = int(input())
sums = 0
x = []
x = sorted(map(int,input().split()))
for i in range(len(x)):
    sums += x[i]
print(x[0],x[i],sums)

Submission status: Accepted

Solution code:
n=int(input())
ns=input().split()
for i in range(len(ns)):
    ns[i]=int(ns[i])

m=min(ns)
M=max(ns)
S=sum(ns)

print(m,M,S)

Submission status: Accepted

Solution code:
n = int(input())
a = [int(i) for i in input().split()] 
print("{} {} {}".format(min(a),max(a),sum(a)))

Submission status: Accepted

Solution code:
n = int(input())
x = list(map(int,input().split()))
a = min(x)
b = max(x)
c = sum(x)
print(a,b,c)

Submission status: Accepted

Solution code:
n = input()
table = list(map(int,input().split()))
print("{} {} {}".format(min(table),max(table),sum(table)))

Submission status: Accepted

Solution code:
num = int(input())
list = input().split()
for i in range(num):
    list[i] = int(list[i])
print(min(list), max(list), sum(list))

Submission status: Accepted

Solution code:
n = int(input())
a = map(int, input().split())

max = -1000001
min = 1000000
sum = 0
for x in a:
    if(max < x):
        max = x
    if(min > x):
        min = x
    sum += x

print(min, max, sum)

Submission status: Accepted

Solution code:
num = int(input())

lines = [int(n) for n in input().split()]

print(min(lines),max(lines),sum(lines))

Submission status: Accepted

Solution code:
def main():
    int(input())
    a = list(map(int, input().split()))
    print(min(a), max(a), sum(a))


main()

Submission status: Accepted

Solution code:
n = int(input())
l = list(map(int,input().split(' ')))
print("{0} {1} {2}".format(min(l),max(l),sum(l)))

Submission status: Accepted

Solution code:
n=int(input( ))
a=list(map(int, input().split()))
a_min=sorted(a)
a_sum=sum(a)

print(a_min[0],a_min[-1],a_sum)

Submission status: Accepted

Solution code:
a=input()
b=input()
c=b.split()
e=list()
for d in c:
        e.append(int(d))
print(min(e),max(e),sum(e))

Submission status: Accepted

Solution code:
input()
n = list(map(int, input().split()))

print(min(n), max(n), sum(n))

Submission status: Accepted

Solution code:
x = int(input())
y = list(map(int,input().split()))

print(min(y),max(y),sum(y))

Submission status: Accepted

Solution code:
n = int(input())
a = list(map(int, input().split()))
a.sort()
m = 0
for i in a:
	m += i
print(a[0], a[n - 1], m)

Submission status: Accepted

Solution code:

arrLength=int(input())
a = list(map(int,input().split()))
min = a
max = a
sum = a
# for i in range(arrLength):
for j in range(arrLength):
    if min[0]>min[j]:
        temp=min[0]
        min[0]=min[j]
        min[j]=temp
minans = min[0]
# for i in range(arrLength):
for j in range(arrLength):
    if max[0]<max[j]:
        temp=max[0]
        max[0]=max[j]
        max[j]=temp
maxans=max[0]

sumans =0
for i in range(arrLength):
    sumans += sum[i]


print(minans,maxans,sumans)

Submission status: Accepted

Solution code:
n = int(input())
num_list = list(map(int, input().split()))
print(min(num_list), end=' ')
print(max(num_list), end=' ')
print(sum(num_list))

Submission status: Accepted

Solution code:
input()
l = list(map(int, input().split()))
print(min(l), max(l), sum(l))

Submission status: Accepted

Solution code:
n = eval(input())
items = input().split()
numbers = [eval(x) for x in items]
min = min(numbers)
max = max(numbers)
sum = sum(numbers)
print(min, max, sum)

Submission status: Accepted

Solution code:
n = int(input())
num = [int(x) for x in input().split()]
print (min(num), max(num), sum(num[0:len(num)]))

Submission status: Accepted

Solution code:
import sys
_ = sys.stdin.readline()
x=sys.stdin.readline()

arr=x.split()

arrInt=list()
#print(arr, type(arr))
for i in arr:
   # print(i)
    arrInt.append(int(i))

#print(arrInt,type(arrInt))
print(min(arrInt),max(arrInt),sum(arrInt))

Submission status: Accepted

Solution code:
import math
n = int(input())
num = [int(x) for x in input().split()][:n]
print(min(num),max(num),sum(num))

Submission status: Accepted

Solution code:
in_str = input()
n = int(in_str) # ignore
in_str = input()
data_seq = [int(i) for i in in_str.split()]
print("{0} {1} {2}".format(min(data_seq), max(data_seq), sum(data_seq)))

Submission status: Accepted

Solution code:
n=int(input())
a=list(map(int, input().split()))
print(min(a),max(a),sum(a))

Submission status: Accepted

Solution code:
n = int(input())
a=list(input().split())
b=[int(i) for i in a]
total = 0
for i in range(n):
    total = total + b[i]
print(min(b),max(b),total)

Submission status: Accepted

Solution code:
N = int(input())
L = list(map(int,input().split()))
print(min(L),max(L),sum(L))

Submission status: Accepted

Solution code:
n = int(input())
sequence = [int(s) for s in input().split()]
s_min = sequence[0]
s_max = sequence[0]
s_sum = 0
for s in sequence:
    if s < s_min:
        s_min = s
    if s> s_max:
        s_max = s
    s_sum += s
print('{} {} {}'.format(s_min, s_max, s_sum))

Submission status: Accepted

Solution code:
n = int(input())
l = map(int, input().split()) 
l = list(l)
print(min(l), max(l), sum(l))

Submission status: Accepted

Solution code:
class min_max_sum:
    def __init__(self,n=0,a=[],sum=0):
        self.n=n
        self.a=a
        self.sum=sum
    def mins(self):
        return min(self.a)
    def maxs(self):
        return max(self.a)
    def sums(self):
        for i in range(0,self.n):
            self.sum+=self.a[i]
        return self.sum
    
p=min_max_sum()
p.n=int(input())
p.a=list(map(int,input().split()))
print("%d %d %d"%(p.mins(),p.maxs(),p.sums()))

Submission status: Accepted

Solution code:
input()
nums = [int(i) for i in input().split()]
nums.sort()
print(nums[0], nums[-1], sum(nums))

Submission status: Accepted

Solution code:
X = int(input())
number = [int(i) for i in input().split()]
print(min(number),max(number),sum(number))

Submission status: Accepted

Solution code:
import sys

values = list(map(int, sys.stdin.readlines()[1].split()))
print(f'{min(values)} {max(values)} {sum(values)}')