Go: package main

import (
	"bufio"
	"fmt"
	"os"
	"strconv"
)

var sc = bufio.NewScanner(os.Stdin)

func nextInt() int {
	sc.Scan()
	n, _ := strconv.Atoi(sc.Text())
	return n
}

func main() {
	sc.Split(bufio.ScanWords)

	a, b, c, d, e := nextInt(), nextInt(), nextInt(), nextInt(), nextInt()
	x := a
	if b < x {
		x = b
	}
	if c < x {
		x = c
	}
	y := d
	if e < y {
		y = e
	}

	fmt.Println(x + y - 50)
}

C++: #include<iostream>
using namespace std;
int main() {
int a, sum = 0;
for (int i = 0; i < 4; i++) {
cin >> a;
sum += a;
}
cout << sum / 60 << endl << sum % 60 << endl;
}
/*#include<iostream>
using namespace std;
int main() {
int min1 = 2000, min2 = 2000, a;
for (int i = 0; i < 3; i++) {
cin >> a;
if (min1 > a)min1 = a;
}
for (int i = 0; i < 2; i++) {
cin >> a;
if (min2 > a)min2 = a;
}
cout << min1 + min2-50 << endl;
}*/
/*#include<iostream>
using namespace std;
int main() {
int a[5], b[2] = {1}, sum = 0;
for (int i = 0; i < 5; i++) {
cin >> a[i];
}
while (a[1] > a[3]*b[0]) {
b[0]++;
//cout << "bakatoy" << endl;
}
while (a[2] > a[4]*b[1]) {
b[1]++;
//cout << "bakatoy" << endl;
}
if (b[0] > b[1]) {
cout << a[0]-b[0] << endl;
}
else {
cout << a[0]-b[1] << endl;
}
}*/
/*#include<iostream>
using namespace std;
int main() {
	int a, sum=0;
	for (int i = 0; i<5; i++) {
		cin >> a;
		if (a < 40)a = 40;
		sum += a;
	}
	cout << sum / 5 << endl;
}*/

C++: #include<stdio.h>
int main(void)
{
	int a,b,c,d,e;
	int ans1,ans2;
	scanf("%d%d%d%d%d",&a,&b,&c,&d,&e);
	
	if(a<b)
		ans1=a;
	else
		ans1=b;
	
	if(ans1>c)
		ans1=c;
		
	if(d<e)
		ans2=d;
	else
		ans2=e;
	
	printf("%d\n",ans1+ans2-50);
}

C++: #include <cstdio>
#include <algorithm>
using namespace std;

int main(){
	int a[5];
	for(int i = 0; i < 5; i++){
		scanf("%d",&a[i]);
	}
	sort(a,a+3);
	sort(a+3,a+5);
	printf("%d\n",a[0]+a[3]-50);
	return 0;
}

C++: #include<cstdio>
#include<iostream>
using namespace std;
int main()
{
	int x1,x2,x3,y1,y2;
	scanf("%d%d%d%d%d",&x1,&x2,&x3,&y1,&y2);
	printf("%d\n",min(x1,min(x2,x3))+min(y1,y2)-50);
	return 0;
}

C++: #include<iostream>
#include<vector>
#include<algorithm>
using namespace std;
int main(){
    vector<int> p(3);
    vector<int> j(2);
    for(int i = 0;i < 3;i++){
        cin >> p[i]; 
    }
    for(int i = 0;i < 2;i++){
        cin >> j[i]; 
    }
    sort(p.begin(),p.end());
    sort(j.begin(),j.end());
    cout << p[0] + j[0] - 50 << endl;
}

C++: //2013
#include<iostream>
using namespace std;
int main(void){
	int i,p[3]={0},j[2]={0},minp=2000,minj=2000;
	for(i=0;i<3;i++){
		cin>>p[i];
		if(minp>p[i]){
			minp=p[i];
		}
	}
	for(i=0;i<2;i++){
		cin>>j[i];
		if(minj>j[i]){
			minj=j[i];
		}
	}
	cout<<minp+minj-50<<endl;
	
	return 0;
}

C++: //12-1 ?????????
#include<iostream>
#include<stdio.h>
#include<string>
#include<vector>
#include<map>
using namespace std;
int main(){
    int ans = -50;
    int min = 2001;
    for(int i=0; i<3; i++){
        int tmp;
        cin >> tmp;
        if(tmp<min) min=tmp;
    }
    ans += min;
    min = 2001;
    for(int i=0; i<2; i++){
        int tmp;
        cin >> tmp;
        if(tmp<min) min=tmp;
    }
    ans += min;
    cout << ans << endl;
    return 0;
}

C++: #include <iostream>
#include <climits>
#define PASTA 3
#define JUICE 2
#define OFF 50

using namespace std;

int main(){
  int pa[ PASTA ];
  int ju[ JUICE ];
  int i, j;
  int min = INT_MAX;
  
  cin >> pa[ 0 ] >> pa[ 1 ] >> pa[ 2 ] >> ju[ 0 ] >> ju[ 1 ];

  for( int i = 0; i < PASTA; i++ ){
    for( int j = 0; j < JUICE; j++ ){
      int price = pa[ i ] + ju[ j ] - OFF;
      if( price < min ){ min = price; }
    }
  }

  cout << min << endl;

  return 0;
}

C++: #include<iostream>
#include<algorithm>
using namespace std;
int main(){
    int a=2000,b=2000;
    int c;
    for(int i=0;i<3;++i) {
        cin>>c;
        a=min(a,c);
    }
    for(int i=0;i<2;++i) {
        cin>>c;
        b=min(c,b);
    }
    cout<<a+b-50<<endl;
    return 0;
}

C++: #include<stdio.h>
#include<iostream>
using namespace std;
int main(void){
	int p[3],j[2],i,t,a;
	for(i=0;i!=3;i++)
		cin>>p[i];
	for(i=0;i!=2;i++){
		for(a=i;a!=3;a++){
			if(p[i]>p[i+1]){
				t=p[i];
				p[i]=p[a];
				p[a]=t;
			}
		}
	}
	t=p[0];
	cin>>j[0]>>j[1];
	if(j[0]<j[1])
		t+=j[0];
	else
		t+=j[1];
	cout<<t-50<<endl;
}

C++: #include <iostream>
#include <string>
#include <algorithm>

using namespace std;

int main()
{
	int a [3];
	int b [2];
	cin >> a[1] >> a[2] >> a[3] >> b[1] >> b[2];
	int c[6]= {a[1] + b[1], a[1] + b[2], a[2] + b[1], a[2] + b[2], a[3] + b[1], a[3] + b[2]};
	sort(c, c + 6);
	{
	    cout << c[1] - 50 << endl;
	}
	return 0;
}

C++: #include <iostream>
using namespace std;
int main(void){
    int a,b,c,d,e;
    cin>>a>>b>>c>>d>>e;
    int x,y;
    x=a;
    if(x>b) x=b;
    if(x>c) x=c;
    y=d;
    if(y>e) y=e;
    cout<<y+x-50;
    cout<<endl;
}

C++: #include<iostream>
using namespace std;
#define INF 100000;
int main(){
    int a,b;
    a=b=INF;
    for(int i=0;i<3;i++){
        int c;
        cin>>c;
        a=min(a,c);
    }
    for(int i=0;i<2;i++){
        int c;
        cin>>c;
        b=min(b,c);
    }
    cout<<a+b-50<<endl;
    return 0;
}

C++: #include<bits/stdc++.h>
using namespace std;

#define lp(i,n) for(int i=0;i<n;i++)
#define lpin(a,i,n) for(int i=0;i<n;i++){cin>>a[i];}
int main(){
  int a,b,c,d,e;
  cin>>a>>b>>c>>d>>e;
  if(a>b) a=b;
  if(a>c) a=c;
  if(d>e) d=e;
  cout<<a+d-50<<endl;
  return 0;
}

C++: #include <bits/stdc++.h>
using namespace std;

int main() {
	int p,ps=2001,j,js=2001;
	for(int i=1; i<=3; i++){
		cin>>p;
		if(ps>p)
			ps=p;
	}
	for(int i=1; i<=2; i++){
		cin>>j;
		if(js>j)
			js=j;
	}
	cout<<ps+js-50<<endl;
	return 0;
}

C++: #include<iostream>
#include<string>
#include<sstream>
#include<algorithm>
#include<cmath>
#include<map>
#include<set>
#include<vector>
#include<stack>
#include<queue>
#include<deque>
using namespace std;

int main() {

    int pasta, juice;
    int n;

    cin >> pasta;
    cin >> n;
    if (n < pasta)  pasta = n;
    cin >> n;
    if (n < pasta)  pasta = n;
    cin >> juice;
    cin >> n;
    if (n < juice)  juice = n;

    cout << pasta + juice - 50 << endl;

     
    return 0;
}

C++: #include<iostream>
using namespace std;
int i, n, pA, pB, tA = 0, tB = 0;
int main(){
    while(cin >> n) {
        if(n == 0) { break; }
        for (i=1; i<=n; i++) {
            cin >> pA >> pB;
            if (pA >pB) {
                tA += pA +pB;
            } else {
                if (pA<pB) {
                    tB += pA +pB;
                } else {
                    tA += pA;
                    tB += pB;
                }
            }
         }
         cout << tA << " " << tB << endl;
         tA = 0; tB = 0;
    }
    return 0;
}

C++: #include<iostream>
using namespace std;
int main()
{
	int a,b,m=2000,n=2000,i;
	for(i=0;i<3;i++){
		cin>>a;
		if(m>a){
			m=a;
		}
	}
	for(i=0;i<2;i++){
		cin>>b;
		if(n>b){
			n=b;
		}
	}
	cout<<m+n-50<<endl;
	return 0;
}

C++: #include<bits/stdc++.h>
using namespace std;





int main(){
  int a[3];
  int x[2];
  cin>>a[0]>>a[1]>>a[2]>>x[0]>>x[1];
  
  sort(a,a+3);
  sort(x,x+1);
  int ans=a[0]+x[0]-50;
  cout<<ans<<endl;
  
  
  return 0;
}