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<stdio.h>
int main(void)
{
	int ps1,ps2,ps3,ju1,ju2;
	
	scanf("%d",&ps1);
	scanf("%d",&ps2);
	scanf("%d",&ps3);
	scanf("%d",&ju1);
	scanf("%d",&ju2);
	
	
	
	
	
	
	int ps,ju;
	
	ps = 0;
	ju = 0;
	
	
	if(ps1 >= ps2 && ps2 <= ps3)
	{
		ps = ps2;
	}
	
	else if (ps2 >= ps3 && ps3 <= ps1)
	{
		ps = ps3;
	}
	else if(ps3 >= ps1 && ps1 <= ps2)
	{
		ps = ps1;
	}
	
	
	if (ju1 >= ju2)
	{
		ju = ju2;
	}
	
	else if(ju2 >= ju1)
	{
		ju = ju1;
	}
	
	
	
	
	int baka;
	
	
	baka = ju + ps - 50;
	
	
	
	printf("%d",baka);
	
}

C++: #include <stdio.h>
#include <algorithm>
using namespace std;

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

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

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

C++: #include<iostream>
using namespace std;
int main()
{
int a,b,c,d,e;
int MAX_p,MAX_q;

cin>>a>>b>>c>>d>>e;

if(a<=b&&a<=c)
{
MAX_p=a;
}
else if(b<=a&&b<=c)
{
MAX_p=b;
}
else
{
MAX_p=c;
}

if(d<=e)
{
MAX_q=d;
}
else
{
MAX_q=e;
}

cout<<MAX_p+MAX_q-50<<endl;
}

C++: #include <iostream>
#include <algorithm>
#include <string>
#include <vector>
#include <set>
#include <map>

using namespace std;

int main()
{
    int a[5];
    for(int i=0;i<5;++i) cin >> a[i];
    cout << min(a[0],min(a[1],a[2]))+min(a[3],a[4])-50 << endl;
}

C++: #include<iostream>
#include<cstdio>
using namespace std;
int main()
{
	int i,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 <algorithm>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <functional>
#include <iostream>
#include <map>
#include <ostream>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#define INF 1000000000
#define rep(i,a,b) for (int i=(a);i<(b);i++)
#define rev(i,a,b) for (int i=(a)-1;i>=b;i--)
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef queue<int> qi;
typedef vector<int> vi;
typedef vector<string> vs;
int dx[4] = { 0, 1, 0, -1 };
int dy[4] = { 1, 0, -1, 0 };

int main() {
	cin.tie(0);
	ios::sync_with_stdio(false);

  int p = -1, g = -1;
  rep(i,0,3) {
    int a;
    cin >> a;
    p = min(p, a);
  }
  rep(i,0,2) {
    int a;
    cin >> a;
    g = min(g, a);
  }

  cout << p+g-50 << endl;


	return 0;
}

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

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

int main()
{
	int price[5];

	for (int i = 0; i < 5; i++){
		cin >> price[i];
	}

	sort(price, price + 3);
	
	cout << price[0] - min(price[3], price[4]) << endl;

	return (0);
}

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

int main(){
  int p1,p2,p3;
  cin>>p1>>p2>>p3;
  int lowPasta;
  if(p1<=p2){
    if(p1<=p3){
      lowPasta=p1;
    }else{
      lowPasta=p3;
     }
  }else{
    if(p2<=p3){
       lowPasta=p2;
    }else{
       lowPasta=p3;
     }
  }

  int j1,j2;
  cin>>j1>>j2;
  int lowJuice;
  if(j1<=j2){
     lowJuice=j1;
   }else{
     lowJuice=j2;
   }

  cout<<lowPasta+lowJuice-50<<'\n';
  return 0;
}

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

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

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

int main(){
   int a, b, c, d, e;
   cin>>a;
   cin>>b;
   cin>>c;
   cin>>d;
   cin>>e;
   if(a > b) swap(a, b);
   if(a > c) swap(a, c);
   if(d > e) swap(d, e);
   cout<<a + d - 50<<endl;

   return 0;
}

C++: #include <bits/stdc++.h>
#define rep(i,n)for(int i=0;i<n;i++)
using namespace std;
typedef long long ll;

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

C++: #include<iostream>
#include<algorithm>
using namespace std;
int main(){
	int x[3],i,j,y[2],ans1=0,ans2=0,ans3;
	for(i=0;i<3;i++){
		cin>>x[i];
	}
	sort(x,x+3);
	ans1=x[0];
	for(j=0;j<2;j++){
		cin>>y[j];
	}
	sort(y,y+2);
	ans2=y[0];
	ans3=ans1+ans2-50;
	cout<<ans3<<endl;
	return 0;
}

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

int min(int a, int b){
	return (a > b)? b : a;
}

int main(){
	const int INF = 10000;
	int pas = INF, jui = INF;
	int n;
	
	for(int i = 0; i < 3; i++){
		scanf("%d", &n);
		pas = min(pas, n);
	}
	for(int i = 0; i < 2; i++){
		scanf("%d", &n);
		jui = min(jui, n);
	}
	
	printf("%d\n", pas + jui - 50);
	
	return 0;
}

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

int main(){
	int pasta[3],juice[2],sum;
	for(int i=0;i<3;i++)cin>>pasta[i];
	for(int i=0;i<2;i++)cin>>juice[i];
	sum=pasta[0]+juice[0]-50;
	for(int i=0;i<3;i++){
		for(int j=0;j<2;j++){
			if(sum>(pasta[i]+juice[j]-50))sum=pasta[i]+juice[j]-50;
		}
	}
	cout<<sum<<endl;
	}

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

C++: #include<bits/stdc++.h>

using namespace std;

int main(){
  int a[3]={};
  int b[2]={};
  int min = 0;

  for(int i= 0;i < 3;i++)
    {
      cin >> a[i];
    }
  for(int j= 0;j < 2;j++)
    {
      cin >> b[j];
    }
  sort(a,a+3);
  sort(b,b+2);

  min = a[0]+b[0];
  
  cout << min-50 << endl;
}

C++: #include<iostream>
using namespace std;
int main()
{
int a,b,c,d,e;
int MAX_p,MAX_q;

cin>>a>>b>>c>>d>>e;

if(a<=b&&a<=c)
{
MAX_p=a;
}
else if(b<=a&&b<=c)
{
MAX_p=b;
}
else
{
MAX_p=c;
}

if(d<=e)
{
MAX_q=d;
}
else
{
MAX_q=e;
}
}

C++: #include<iostream>
using namespace std ;
int main()
{
	int pas[ 3 ] ;
	int juice ;
	int min = 2000 ;
	for( int i = 0 ; i < 3 ; i++ )
		cin >> pas[ i ] ;
	for( int i = 0 ; i < 2 ; i++ )
	{
		cin >> juice ;
		for( int j = 0 ; j < 3 ; j++ )
			min = min > pas[ j ] + juice - 50 ? pas[ j ] + juice - 50 : min ;
	}
	cout << min << endl ;
	return 0 ;
}

C++: #include<bits/stdc++.h>
typedef long long ll;
using namespace std;
int main() {
	int a, b, c, d, e;
	cin >> a;
	cin >> b;
	cin >> c;
	cin >> d;
	cin >> e;
	cout << min(min(a, b), c) + min(d, e) - 50 << endl;
}

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

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

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

	return 0;
}

C++: #include<iostream>
using namespace std;
int main(void)
{
    int p1,p2,p3,dr1,dr2;
    cin>>p1>>p2>>p3>>dr1>>dr2;
    if(p2<p1&&p2<p3)p1=p2;
    else if(p3<p1&&p3<p2)p1=p3;
    if(dr2<dr1)dr1=dr2;
    cout<<dr1+p1-50<<"\n";
}