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:
line = input()
nums = list(map(int, input().split()))

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
num = int(input())
inVal = input().split()
sum = 0
result = []
for n in range(num):
    result.append(int(inVal[n]))
    sum = sum + int(inVal[n])
print(str(min(result)) + " " + str(max(result)) + " " + str(sum))

Submission status: Accepted

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

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

print(a,b,c)

Submission status: Accepted

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

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

print(min(l), max(l), sum)

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())
l = list(map(int, input().split()))
print(min(l), max(l), sum(l))

Submission status: Accepted

Solution code:
num = int(input())

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

print(min(num_list),max(num_list),sum(num_list))

Submission status: Accepted

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

mini = min(l)
maxi = max(l)
sums = 0

for i in range(0,n):
    sums = sums + int(l[i])
    
print(f"{mini} {maxi} {sums}")

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())
x = [int(v) for v in input().split()]
print(min(x), max(x), sum(x))

Submission status: Accepted

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

Submission status: Accepted

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

print("{:d} {:d} {:d}".format(min(a_list),max(a_list),sum(a_list)))

Submission status: Accepted

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

Submission status: Accepted

Solution code:

nums1 = []
sum = 0
for i in range(2):
    nums = [int(e) for e in input().split()]
    nums1.append(nums)

max = nums1[1][0]
min = nums1[1][0]
sum = 0

for i in range(len(nums1[1])):
    if nums1[1][i]>max:
        max = nums1[1][i]
    if nums1[1][i]<min:
        min = nums1[1][i]
    sum = sum + nums1[1][i]
    
print(min, max, sum)

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:
input()
list=[int(i) for i in input().split()]
print(min(list),max(list),sum(list))

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 = sorted([int(x) for x in input().split()])
print(a[0],a[-1],sum(a))

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()) 
ns = list(map(int, input().split()))

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

Submission status: Accepted

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

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()) #いらない
ns = list(map(int, input().split()))

# min, max, sum を使う
print(min(ns), max(ns), sum(ns))

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())
data = list(map(int, input().split()))   # 1行にある複数の値を整数にして、リストにしまう
#
vmin = min(data)  # 最小値
vmax = max(data)  # 最大値
vsum = sum(data)  # 合計
#
print(vmin, vmax, vsum)

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()) #
ns = list(map(int, input().split()))


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

Submission status: Accepted

Solution code:
#入力
n = int(input()) #いらない
ns = list(map(int, input().split()))

# min, max, sum を使う
print(min(ns), max(ns), sum(ns))

Submission status: Accepted

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

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())
ns = list(map(int, input().split()))


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

Submission status: Accepted

Solution code:

n = int(input())

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

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

Submission status: Accepted

Solution code:
from sys import stdin

stdin.readline()

arr = tuple(int(n) for n in stdin.readline().rstrip().split())

print(min(arr), max(arr), sum(arr))

Submission status: Accepted

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

Submission status: Accepted

Solution code:
num = int(input())
lis = list(map(int,input().split()))
sum = 0
min = lis[0]
max = lis[0]
for i in range(num):
    if(min > lis[i]):min = lis[i]
    if(max < lis[i]):max = lis[i]
    sum = sum+lis[i]
    
print("%d %d %d" %(min,max,sum))

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
num = 2000000

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

max = -num
min = num
total = 0

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

print('%d %d %d'%(min, max, total))

Submission status: Accepted

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

# min, max, sum は関数名なので
# 別名を使うとよい
min0 = 10000000
max0 = -10000000
sum0 = 0
for x in ns:
  min0 = min(min0, x)
  max0 = max(max0, x)
  sum0 += x
 
print(min0, max0, sum0)

Submission status: Accepted

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

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())
ns = list(map(int, input(). split()))

min0 = 10000000
max0 = -10000000
sum0 = 0
for x in ns:
  min0 = min(min0, x)
  max0 = max(max0, x)
  sum0 += x
  
print(min0, max0, sum0)

Submission status: Accepted

Solution code:
def az11():
    n, xs = int(input()), map(int,raw_input().split())
    print min(xs), max(xs), sum(xs)

az11()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
t = int(raw_input())
a = raw_input().split()
small = int(a[0])
large = int(a[0])
total = 0
for i in a:
    v = int(i)
    if v < small:
        small = v
    if v > large:
        large = v
    total = total + v
print small,large,total

Submission status: Accepted

Solution code:
n = input()
a = map(int, raw_input().split())
a.sort()
sum = 0
for i in range(len(a)):
    sum += a[i]
print("%d %d %d" %(a[0], a[len(a) - 1], sum))

Submission status: Accepted

Solution code:
input()

arr = list(map(int, input().split()))
print(min(arr), max(arr), sum(arr))

Submission status: Accepted

Solution code:
input()
nums = list(map(int, input().split()))
n1, n2, n3 = min(nums), max(nums), sum(nums)
print(' '.join(map(str, [n1, n2, n3])))

Submission status: Accepted

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

Submission status: Accepted

Solution code:
input()
a = list(map(lambda x : int(x), input().split(" ")))
print("%d %d %d" % (min(a), max(a), sum(a)))

Submission status: Accepted

Solution code:
n=int(raw_input())
ls=[int(i) for i in raw_input().split()]
ls.sort()
print ls[0],
print ls[len(ls)-1],
sum=0
for j in ls:
    sum+=j
print sum

Submission status: Accepted

Solution code:
n = int(raw_input())
a = map(int, raw_input().split())
sm = 0
h = len(a) / 2

while h > 0:
	for x in xrange(0,len(a)):
		y = x
		tmp = a[y]
		while y - h >= 0 and a[y-h] > tmp:
			a[y] = a[y-h]
			y = y - h
		a[y] = tmp
		
	if h == 1:
		h = 0
	elif h / 2 != 0:
		h = h / 2
	else:
		h = 1

for x in xrange(0,len(a)):
	sm = sm + a[x]

print a[0], a[len(a)-1], sm

Submission status: Accepted

Solution code:
raw_input()
args = map(int, raw_input().split(" "))
print " ".join(map(str, [min(args), max(args), sum(args)]))

Submission status: Accepted

Solution code:
n = int(input())
data = list(map(int, input().split()))
print('%d %d %d' % (min(data), max(data), sum(data)))

Submission status: Accepted

Solution code:
n = input()
a = map(int,raw_input().split())
sum = a[0]
max = a[0]
min = a[0]
for i in range(1,n):
	sum += a[i]
	if min > a[i]:
		tmp = min
		min = a[i]
		a[i] = tmp
	if  a[i] > max:
		tmp = max
		max = a[i]
		a[i] = tmp
print str(min),str(max),str(sum)

Submission status: Accepted

Solution code:
n = input()

if n != 0:
	l = [int(x) for x in raw_input().split()]		
	print min(l), max(l), sum(l)
else:
	print "0 0 0"

Submission status: Accepted

Solution code:
n = input()
l = sorted(map(int,raw_input().split()))
print l[0], l[n-1], reduce(lambda x,y: x+y, l)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
n = int(raw_input())
ai_list = map(int, raw_input().split())

max_ai = max(ai_list)
min_ai = min(ai_list)
sum_ai = sum(ai_list)

print '%d %d %d' % (min_ai, max_ai, sum_ai)

Submission status: Accepted

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

print '%d %d %d' % (min(list),max(list),sum(list))

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
n = int(raw_input())
list_ = map(int, raw_input().split())
sum = 0
for x in list_:
	sum += x
print min(list_), max(list_), sum

Submission status: Accepted

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

Submission status: Accepted

Solution code:
raw_input()
num_list = map(int, raw_input().split(" "))
print "%d %d %d" % (min(num_list), max(num_list), sum(num_list))

Submission status: Accepted

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

Submission status: Accepted

Solution code:
n = int(raw_input())

a = map(int, raw_input().split())

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
input()

data = [int(x) for x in input().split()]
print(min(data), max(data), sum(data))

Submission status: Accepted

Solution code:
sum = 0
max = -10000000
min = 10000000

input()

for i in [int(x) for x in input().split()]:
    sum += i
    if i > max:
        max = i

    if i < min:
        min = i

print(min,max,sum)

Submission status: Accepted

Solution code:
sum = 0
max = -10000000
min = 10000000

input()

for i in [int(x)  for x in input().split()]:
    sum += i
    if i > max:
        max = i

    if i < min:
        min = i
print(min, max, sum)

Submission status: Accepted

Solution code:
input()

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

print(min(data), max(data), sum(data))

Submission status: Accepted

Solution code:
input()

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

print(min(data),max(data),sum(data))

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
n = int(raw_input())

ls = map(int,raw_input().split())
mi = min(ls)
ma = max(ls)
su = sum(ls)
print "%d %d %d" % (mi,ma,su)

Submission status: Accepted

Solution code:
import sys
n = int(sys.stdin.readline())
l = [int(i) for i in sys.stdin.readline().split()]
print(min(l), max(l), sum(l))

Submission status: Accepted

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

Submission status: Accepted

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

def add(x, y):
	return x+y
	
print "%d %d %d" % (min(a_list), max(a_list), reduce(add, a_list))

Submission status: Accepted

Solution code:
if __name__ == '__main__':
    n = int(input())
    nums = [int(i) for i in input().split()]
    print(min(nums), max(nums), sum(nums))

Submission status: Accepted

Solution code:
#!/usr/bin/env python
# -*- coding: utf-8 -*-

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

Submission status: Accepted

Solution code:
# Python 3
if __name__ == "__main__":
	input()
	str = input()
	a = [int(x) for x in str.split()]
	print(min(a), max(a), sum(a))

Submission status: Accepted

Solution code:
#coding:utf-8
#1_4_D 2015.3.29
n = input()
data = list(map(int,input().split()))
sum = 0
for elem in data:
    sum += elem
print('{} {} {}'.format(min(data),max(data),sum))

Submission status: Accepted

Solution code:
#coding:utf-8
#1_4_D 2015.3.29
n = input()
data = list(map(int,input().split()))
print('{} {} {}'.format(min(data),max(data),sum(data)))

Submission status: Accepted

Solution code:
#coding:utf-8
#1_4_D 2015.3.29
n = input()
data = list(map(int,input().split()))
print(min(data),max(data),sum(data))

Submission status: Accepted

Solution code:
n=2
while n>0 :
	n=n-1
	a=map(int,raw_input().split())
else:
	print min(a),max(a),sum(a)

Submission status: Accepted

Solution code:
import sys

n = int( sys.stdin.readline() )
nums = [ int( val ) for val in sys.stdin.readline().split( " " ) ]

print( "{:d} {:d} {:d}".format( min( nums ), max( nums ), sum( nums ) ) )

Submission status: Accepted

Solution code:
n=int(input())
data=list(map(int, input().split()))
print('%d %d %d' % (min(data), max(data), sum(data) ))

Submission status: Accepted

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

Submission status: Accepted

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

a_ = sorted(a)
sum = 0

for e in a_:
	sum += e

print "%d %d %d" %(a_[0], a_[-1], sum)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#!/usr/bin/python
# -*- coding: utf-8 -*-

n = (int)(raw_input())
data = map(int, raw_input().split(' '))
print min(data), max(data), sum(data)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
def main():

    n = int(input())
    numbers = list(map(int, input().split()))
    ans1 = min(numbers)
    ans2 = max(numbers)
    ans3 = sum(numbers)
    print(ans1, ans2, ans3)






if __name__=="__main__":
    main()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# coding=utf-8
_ = raw_input()
nums = map(int, raw_input().rstrip().split())
print min(nums), max(nums), sum(nums)

Submission status: Accepted

Solution code:
if __name__ == "__main__":

    n = int(raw_input())
    v = map( int, raw_input().split())

    min = 1000000
    max = -1000000
    s = 0
    i = 0
    while i < n:
       if min > v[i]:
           min = v[i]
       if max < v[i]:
           max = v[i]
       s += v[i]
       i += 1

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

Submission status: Accepted

Solution code:
def min(a,i):
  x = a[0]
  for t in range(0, i):
    if x > a[t]:
      x = a[t]
  return x

def max(a,i):
  y = a[0]
  for t in range(0, i):
    if y < a[t]:
      y = a[t]
  return y

def sum(a,i):
  s = 0
  for t in range(0, i):
    s += a[t]
  return s

i = int(raw_input())
a = map(int, raw_input().split())
print "%d %d %d" % (min(a,i), max(a,i), sum(a,i))

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())
data = [int(i) for i in input().split()]

print(min(data), max(data), sum(data))

Submission status: Accepted

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

minimum = min(data)
maximum = max(data)
total = sum(data)

print(minimum, maximum, total)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
input()
data = [int(i) for i in input().split()]
 
minimum = min(data)
maximum = max(data)
total = sum(data)
 
print(minimum, maximum, total)

Submission status: Accepted

Solution code:
input()
data = [int(i) for i in input().split()]
  
minimum = min(data)
maximum = max(data)
total = sum(data)
  
print(minimum, maximum, total)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import warnings


number = input()

array = map(int, raw_input().split())

num_max = array[0]

num_min = array[0]

data_sum = 0

#print len(array)

for i in range(len(array)):
	
	data_sum = data_sum + array[i]

	if array[i] < num_min: 
		num_min = array[i]
	
	if array[i] > num_max:
		num_max = array[i]

print num_min, num_max, data_sum

Submission status: Accepted

Solution code:
count = int(raw_input())

arr = map(int, raw_input().split())

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

Submission status: Accepted

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

Submission status: Accepted

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

maximum = max(nums)
minimum = min(nums)
total = sum(nums)

print(minimum, maximum, total)

Submission status: Accepted

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

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

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

Submission status: Accepted

Solution code:
input()
nums = [int(i) for i in input().split()]
 
maximum = max(nums)
minimum = min(nums)
total = sum(nums)
 
print(minimum, maximum, total)

Submission status: Accepted

Solution code:
if __name__ == "__main__":
    input()
    str = input()
    a = [int(x) for x in str.split()]
    print(min(a), max(a), sum(a))

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
from itertools import tee
print(
    ' '.join(
        map(str,
            map(lambda f, ns: f(ns),
                (min, max, sum),
                (lambda m: tee(m, 3))(
                    map(int,
                        (lambda _, line: line.split())(
                            input(), input())))))))

Submission status: Accepted

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

Submission status: Accepted

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

maxValue = max(i)
minValue = min(i)
sumValue = sum(i)

print('{} {} {}'.format(minValue, maxValue, sumValue))

Submission status: Accepted

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

Submission status: Accepted

Solution code:
count = int(raw_input())
lis = map(int, raw_input().split())
mi = lis[0]
ma = lis[0]
su = 0
for i in lis:
    if i < mi:
        mi = i
    if i > ma:
        ma = i
    su += i

print '%d %d %d'%(mi, ma, su)

Submission status: Accepted

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

print( min(nums), max(nums), sum(nums))

Submission status: Accepted

Solution code:
n = int(input())

num_list = [int(i) for i in input().split(" ")]

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

print("{0} {1} {2}".format(a, b, c))

Submission status: Accepted

Solution code:
n = input()
l = map(int, raw_input().split())
max = l[0]
min = l[0]
s = l[0]
k = 1
while k < n:
    if max < l[k]:
        max = l[k]
    if min > l[k]:
        min = l[k]
    s = s + l[k]
    k = k + 1
print min, max, s

Submission status: Accepted

Solution code:
n = input()
a = map(int, raw_input().split())
if len(a) == n:
    print "%d %d %d" % (min(a), max(a), sum(a))

Submission status: Accepted

Solution code:
num = int(raw_input())
x = raw_input().split()
i = 0
y = []
while i < num :
	y.append(int(x[i]))
	i = i + 1
ma, mi = y[0], y[0]
i = 1
while i < num :
	if ma < y[i] :
		ma = y[i]
	if mi > y[i] :
		mi = y[i]
	i = i + 1
s = sum(y)
print u"%d %d %d" % (mi, ma, s)

Submission status: Accepted

Solution code:
n = input()
a_list = map(int,raw_input().split())
a_list.sort()
sum = 0
for i in a_list :
	sum += i
print'%d %d %d' %(a_list[0],a_list[-1],sum)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# encoding:utf-8

count = input()
input = map(int, raw_input().split())

min = min(input)
max =max(input) 
sum = sum(input)

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

Submission status: Accepted

Solution code:
import sys
lines = sys.stdin.readlines()
l = map(int, lines[1].split())
print min(l),max(l),sum(l)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
n = int(raw_input())
in_line = raw_input().split()
a = []
for i in in_line:
    a.append(int(i))
a.sort()
print a[0],
print a[len(a)-1],
print sum(a)

Submission status: Accepted

Solution code:
input()
xs = list(map(int, input().split()))
print(' '.join(map(str,[f(xs) for f in [min,max,sum]])))

Submission status: Accepted

Solution code:
# first line > /dev/null
input()
items = sorted([int(i) for i in input().split(' ')])
print(items[0], items[-1], sum(items))

Submission status: Accepted

Solution code:
import sys

n = sys.stdin.readline()
list = map(int,sys.stdin.readline().split())

print('%d %d %d' % (min(list),max(list),sum(list)))

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:
import sys

n = sys.stdin.readlines()

nstr = list(map(int, n[1].split(" ")))

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-

import math

# ??\???
n = int(input())
a = []
for i in input().split():
    a.append(int(i))

a.sort()

print(a[0], a[n - 1], sum(a))

Submission status: Accepted

Solution code:
_ = int(input())
a = map(int, raw_input().split(' '))
print min(a), max(a), sum(a)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
n = input()
line = raw_input().split()
val = [int(line[i]) for i in range(n)]
print '%d %d %d' % (min(val), max(val), sum(val))

Submission status: Accepted

Solution code:
num = int(raw_input())
a = map(int, raw_input().split())
Max = a[0]
Min = a[0]
Sum = 0
for i in range(num):
    if Max < a[i]:
        Max = a[i]
    if Min > a[i]:
        Min = a[i]
    Sum = Sum + a[i]
print "%d %d %d" %(Min, Max, Sum)

Submission status: Accepted

Solution code:
n = input()
l = map(int, raw_input().split())
max = l[0]
min = l[0]
s = 0
for i in range(n):
 if max < l[i]:
  max = l[i]
 if min > l[i]:
  min = l[i]
 s = s + l[i]
print min, max, s

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
n = input()
N = map(int,raw_input().split())
sum = 0
for i in range (n):
  sum += N[i]

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

Submission status: Accepted

Solution code:
n=input()
a=map(int,raw_input().split())
print "%d %d %d" % (min(a), max(a), sum(a))

Submission status: Accepted

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

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

Submission status: Accepted

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

print '%d %d %d' %(min(m), max(m), sum(m))

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
n = int(raw_input())
a = map(int,raw_input().split())
s = 0
for i in range(n):
    s += a[i]
print min(a),max(a),s

Submission status: Accepted

Solution code:
n = input()
list = map(int,raw_input().split())
print "%d %d %d" % (min(list), max(list), sum(list))

Submission status: Accepted

Solution code:
n = input()

a = map(int, raw_input().split())

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:

n = input()
m = map(int,raw_input().split())
a = 0
for i in xrange(n):
    a += m[i]

print min(m),max(m),a

Submission status: Accepted

Solution code:
n = raw_input()
a = map(int, raw_input().split())
print ("%d %d %d") % (min(a), max(a), sum(a))

Submission status: Accepted

Solution code:

n = int(raw_input())
entry = map(int, raw_input().split())
    
print(str(min(entry)) + " " + str(max(entry)) + " " + str(sum(entry)))

Submission status: Accepted

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

Submission status: Accepted

Solution code:

n = input()
 
a = map(int, raw_input().split())
 
print ("%d %d %d") %(min(a), max(a), sum(a))

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
n = input()
xi = map(int, raw_input().split())
print ("%d %d %d") %(min(xi), max(xi), sum(xi))

Submission status: Accepted

Solution code:
n = input()
x = map(int, raw_input().split())
print ("%d %d %d") %(min(x), max(x), sum(x))

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
n = input()
a = map(int, raw_input().split())
print "%d %d %d" % (min(a), max(a), sum(a))

Submission status: Accepted

Solution code:
n = int(raw_input())
a = map(int, raw_input().split())
print "%d %d %d" %(min(a), max(a), sum(a))

Submission status: Accepted

Solution code:
n = int(raw_input())
a = map(int, raw_input().split())
 
print "%d %d %d" %(min(a), max(a), sum(a))

Submission status: Accepted

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

Submission status: Accepted

Solution code:
n = input()
sum = 0
a = map(int, raw_input().split())
a.sort()
for i in range(n):
  sum += a[i]
print '%d %d %d' % (a[0], a[n-1], sum)

Submission status: Accepted

Solution code:


n = input()
line = raw_input().split()
val = [int(line[i]) for i in range(n)]
print '%d %d %d' % (min(val), max(val), sum(val))

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
n = raw_input()
x = map(int, raw_input().split())
print ("%d %d %d") %(min(x), max(x), sum(x))