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 <set>
#include <map>
#include <list>
#include <queue>
#include <stack>
#include <cmath>
#include <ctype.h>
#include <ctime>
#include <cstdio>
#include <vector>
#include <string>
#include <bitset>
#include <cctype>
#include <cstdlib>
#include <cstring>
#include <utility>
#include <numeric>
#include <complex>
#include <sstream>
#include <fstream>
#include <iomanip>
#include <cassert>
#include <iostream>
#include <iterator>
#include <algorithm>

using namespace std;

#define REP(i, x, n) for(int i = x; i < n; i++)
#define rep(i, n) REP(i, 0, n)

//4方向ベクトル→↑←↓
int dx[] ={1,0,-1,0};
int dy[] ={0,-1,0,1};
int Pas[3];
int drink[2];
int main()
{
  for(int i = 0;i < 3;i++){
    cin >>Pas[i];
  }
  for(int i = 0;i < 2;i++){
    cin>>drink[i];
  }
  sort(Pas,Pas+3);
  sort(drink,drink+2);
  cout <<Pas[0]+drink[0]-50<<endl;

  return 0;
}

C++: #include<iostream>
int main() {
	int pasta[3];
	int juise[2];
	int min1=10000000, min2=1000000;
	for (int i = 0; i < 3; ++i){
		std::cin >> pasta[i];
		if (pasta[i] < min1)min1 = pasta[i];
	}
	for (int i = 0; i < 2; ++i) { 
		std::cin >> juise[i]; if (juise[i] < min2)min2 = juise[i]; }
	std::cout << min1 + min2-50 << std::endl;
	return 0;
}

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

int main()
{
    int p1,p2,p3,j1,j2;
    cin >> p1>>p2>>p3>>j1>>j2;
    cout << min(p1,min(p2,p3))+min(j1,j2)-50<< endl;
    return 0;
}

C++: #include <stdio.h>

main()
{
	int a,b,c,d,e;
	scanf("%d",&a);
	scanf("%d",&b);
	scanf("%d",&c);
	scanf("%d",&d);
	scanf("%d",&e);
	int m,n;
	if (a<b)
		if (a>c) m = c;
		else     m = a;
	else
		if (b>c) m = c;
		else	 m = b;
	if (d<e) n = d;
	else	 n = e;
	int S;
	S = m + n - 50;
	printf("%d\n",S);
}

C++: #include<stdio.h>
int main()
{
	int a, a_min =2001, b, b_min = 2001;
	for (int i = 1; i <= 3; i++) {
		scanf("%d", &a);
		if (a < a_min) {
			a_min = a;
		}
	}
	for(int i=1;i<=2;i++){
		scanf("%d", &b);
		if (b < b_min) {
			b_min = b;
		}

	}
	printf("%d\n", a_min + b_min-50;
}

C++: #include<iostream>
#include <algorithm>
using namespace std;
int main()
{
  int A[3],B[2];
  cin>>A[0]>>A[1]>>A[2];
  cin>>B[0]>>B[1];
 
  sort(A,A+3);
  sort(B,B+2);

  cout<<A[0]+B[0]-50<<endl;
   return 0;
}

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

int main() {
	int a, b, c, d, e, q, w;
	cin >> a >> b >> c >> d >> e;
	q = min({ a,b,c });
	w = min({ d,e });
	cout << q + w - 50;
}

C++: #include <iostream>
#include <cstdio>
#include <algorithm>
#include <string>
#include <cstring>
#include <cctype>
#include <cmath>
#include <stack>
#include <queue>
#include <vector>
#include <set>
#include <map>
#include <list>
#include <stdio.h>
#include <string.h>
#include <cstdlib>
#include <math.h>
#include <bitset>
#define INF 2000000000
using namespace std;
int dx[4]={1,0,-1,0},dy[4]={0,1,0,-1};
#define ll long long
#define PL pair<long long, long long>
#define P pair<int,int>
#define mk make_pair
#define en endl;
#define WHITE 0
#define BLACK 2
#define GRAY 1
#define RE return 0;
#define HERE cout<<"    "<<"HERE"<<en

int main(){
  int p1,p2,p3;
  cin>>p1>>p2>>p3;
  int p=min(p1,p2,p3);
  int j1,j2;
  cin>>j1>>j2;
  int j=min(j1,j2);
  cout<<j+p-50<<en
}

C++: #include <iostream>
#include <fstream>
#include <cstdio>
#include <cmath>
#include <vector>
#include <string>
#include <map>
#include <queue>
#include <algorithm>

#define REP(i,n) for(int i=0; i<n; i++)
#define FOR(i,a,b) for(int i=a; i<=b; i++)
#define ll long long int

using namespace std;

int main(void) {
    int a,b,t;
    cin >> a;
    cin >> t;
    a = min(a,t);
    cin >> t;
    a = min(a,t);
    cin >> b;
    cin >> t;
    b = min(b,t);
    cout << a+b-50 << endl;
    
    return 0;
}

C++: /*
	0565:Lunch
*/
#include	<iostream>
#include	<algorithm>

using namespace std;

int main(void) {
	int p1, p2, p3, j1, j2;
	int price;
	
	cin >> p1 >> p2 >> p3 >> j1 >> j2;
	
	price = min(p1, min(p2, p3) ) + min(j1 , j2) - 50;
	
	cout << price << endl;
	return 0;
}

C++: #include<iostream>
using namespace std;

int a, b, c, d, e;
int main() {
cin >> a >> b >> c >> d >> e;
cout << min(a, min(b, c)) + min(d, e) - 50 << endl;
return 0;
}

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

int main(){
int a=0;
int b=INT_MAX;
int c;
for(int d=0;d<3;d++){
	scanf("%d",&c);
	b=min(b,c);
}
a+=b;
b=INT_MAX;
for(int d=0;d<2;d++){
	scanf("%d",&c);
	b=min(b,c);
}
printf("%d\n",a+b);
}

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

int main(){
  int a,b,c;
  cin >> a >> b >> c;
  int mini = min(min(a,b),c);
  cin >> a >> b;
  mini += min(a,b);
  cout << mini - 50 << endl;
}

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

int main(){
	int a, b, c, d, e;
	scanf("%d %d %d %d %d", &a, &b, &c, &d, &e);
	printf("%d\n", min(a, min(b, c)) + min(d, e) - 50);
	return 0;
}

C++: #include <iostream>
using namespace std;
int main (void)
{
	int p[3],ju1,ju2;
	int sum;
	int tmp;
	for(int i=0;i<3;i++)
	{
		cin >> p[i];
		for(int j=0;j<i;j++)
		{
			if(p[j]>p[i])
			{
				tmp=p[j];
				p[j]=p[i];
				p[i]=tmp;
			}
		}
	}
	cin >> ju1 >> ju2;
	if(ju1>ju2) ju1=ju2;
	sum=p[0]+ju1-50;
	cout << sum;
	return 0;
}

C++: #include <stdio.h>

int main()
{
  int i,j;
  int pasta[3];
  int juse[2];
  int min1,min2;
  for(i=0;i<3;i++)
    {
      scanf("%d",&pasta[i]);
}

min1=pasta[0];

 for(i=1;i<3;i++)
    {
      
      if(min1>pasta[i])min1=pasta[i];
}

 for(i=0;i<2;i++)
    {
      scanf("%d",&juse[i]);
}

min2=juse[0];
 
for(i=1;i<3;i++)
    {      
      if(min2>juse[i])min2=juse[i];
} 

 printf("%d\n",min1+min2-50);

 return 0;

}

C++: #include<iostream>
using namespace std;

int main()
{
 int a,b,c,d,e,x,y;
 cin>>a>>b>>c>>d>>e;

 if(a<=b&&a<=c)x=a;
 if(b<=a&&b<=c)x=b;
 if(c<=a&&c<=b)x=c;

 if(d<e)y=d;
  else y=e;

 cout<<x+y-50<<'\n';

  return 0;
}

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

int main() {
  int pasta1, pasta2, pasta3, juice1, juice2;
  cin >> pasta1 >> pasta2 >> pasta3 >> juice1 >> juice2;

  int min_pasta = min(min(pasta1, pasta2), pasta3);
  int min_juice = min(juice1, juice2);

  cout << min_pasta + min_juice - 50 << endl;

  return 0;
}

C++: // 2012/11/19 Tazoe

#include <iostream>
using namespace std;

int main()
{
	int p1, p2, p3, j1, j2;
	cin >> p1;
	cin >> p2;
	cin >> p3;
	cin >> j1;
	cin >> j2;

	int p = p1;
	if(p>p2){
		p = p2;
	}
	if(p>p3){
		p = p3;
	}

	int j = j1;
	if(j>j2){
		j = j2;
	}

	cout << p+j-50 << '\n';

	return 0;
}

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





int main(){
  int a,b,c;
  int x,y;
  cin>>a>>b>>c>>x>>y;
  a=min(a,b);
  a=min(b,c);
  x=min(x,y);
  a=a+x-50;
  cout<<a<<endl;
  
  
  return 0;
}

C++: #include <iostream>
#include <climits>
using namespace std;

int main(){
  int minP = INT_MAX;
  for(int i = 0; i < 3; i++){
    int x;
    cin >> x;
    minP = min(minP, x);
  }

  int minJ = INT_MAX;
  for(int i = 0; i < 2; i++){
    int x;
    cin >> x;
    minJ = min(minJ, x);
  }

  cout << minP + minJ - 50 << endl;
}

C++: #include <iostream>
using namespace std;

int main(void) {
    int pst=114514, drink=114514;
    int pri;
    for(int i=0; i<3; i++) {
        cin >> pri;
        pst = min(pst, pri);
    }
    for(int i=0; i<2; i++) {
        cin >> pri;
        drink = min(drink, pri);
    }
    cout << pst + drink - 50 << endl;
    return 0;
}