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 <bits/stdc++.h>
using namespace std;

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

int main()
{
  int p[3], j[2];

  cin >> p[0] >> p[1] >> p[2] >> j[0] >> j[1];
  cout << min(p[0], min(p[1], p[2])) + min(j[0], j[1]) - 50;
}

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


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

  if( a < b && a < c && d < e) cout<<(a+d) - 50<<endl;
  if( a < b && a < c && e < d) cout<<(a+e) - 50<<endl;
  if( b < a && b < c && d < e) cout<<(b+d) - 50<<endl;
  if( b < a && b < c && e < d) cout<<(b+e) - 50<<endl;
  if( c < b && c < a && d < e) cout<<(c+d) - 50<<endl;
  if( c < b && c < a && e < d) cout<<(c+e) - 50<<endl;

 return 0;
}

C++: #include<iostream>
#include<string>
#include<math.h>
#include<algorithm>
#include<stack>
#include<queue>
#include<set>

using namespace std;

int main()
{
	int pasta[3];
	int juice[2];

	cin >> pasta[0];
	cin >> pasta[1];
	cin >> pasta[2];
	cin >> juice[0];
	cin >> juice[1];

	sort(pasta, pasta + 3);
	sort(juice, juice + 2);

	cout << pasta[0] + juice[0] - 50 << endl;
	return 0;
}

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

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

C++: #include <iostream>
#include <cstdio>
#include <cstring>
#include <cstdlib>
#include <cmath>
#include <vector>
#include <string>
#include <map>
#include <set>
#include <queue>
#include <stack>
#include <algorithm>

using namespace std;

#define rep(i,j) REP((i), 0, (j))
#define REP(i,j,k) for(int i=(j);(i)<(k);++i)
#define BW(a,x,b) ((a)<=(x)&&(x)<=(b))
#define ALL(v) (v).begin(), (v).end()
#define LENGTHOF(x) (sizeof(x) / sizeof(*(x)))
#define AFILL(a, b) fill((int*)a, (int*)(a + LENGTHOF(a)), b)
#define MP make_pair
#define PB push_back
#define F first
#define S second
#define INF 1 << 30
#define EPS 1e-10

typedef pair<int, int> pi;
typedef pair<int, pi> pii;
typedef vector<int> vi;
typedef queue<int> qi;
typedef long long ll;

int a, b, c, d, e;

int main(){
  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<stdio.h>
int main(void)
{
	int p1,p2,p3,j1,j2,x,y;
	scanf("%d %d %d %d %d",&p1,&p2,&p3,&j1,&j2);
	if(p1<=p2&&p1<=p3)	x=p1;
	if(p2<p1&&p2<=p3)	x=p2;
	if(p3<p1&&p3<p2)	x=p3;
	if(j1<=j2)	y=j1;
	else	y=j2;
	printf("%d\n",x+y-50);
	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 += (j1<j2?j1:j2);
  t -= 50;
  cout << t << endl;
  return 0;
}

C++: #include <iostream>
#include <sstream>
#include <string>
#include <algorithm>
#include <vector>
#include <stack>
#include <queue>
#include <set>
#include <map>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <cassert>

using namespace std;

#define FOR(i,k,n) for(int i=(k); i<(int)n; ++i)
#define REP(i,n) FOR(i,0,n)
#define FORIT(i,c) for(__typeof((c).begin())i=(c).begin();i!=(c).end();++i)

template<class T> void debug(T begin, T end){ for(T i = begin; i != end; ++i) cout<<*i<<" "; cout<<endl; }

typedef long long ll;
const int INF = 100000000;
const double EPS = 1e-8;
const int MOD = 1000000007;

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

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

int main(){
    int s[3], d[2];
    int ret = 1 << 20;
    cin >> s[0] >> s[1] >> s[2] >> d[0] >> d[1];
    for(int i=0;i<3;i++)
        for(int j=0;j<2;j++)
            ret = min(ret, s[i]+d[j]-50);
    cout << ret << endl;
}

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

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

C++: #include<stdio.h>
#include<iostream>
#include<algorithm>
using namespace std;
int main()
{
	int i,p=2001,ps,js,j=2001,g;
	for(i=0;i<3;i++)
	{
		cin>>ps;
		if(p>ps)
			p=ps;
	}
	for(i=0;i<2;i++)
	{
		cin>>js;
		if(j>js)
			j=js;
	}
	g=p+j-50;
	cout<<g<<endl;	
	return 0;
}

C++: 
#include <iostream>
#include <algorithm>
using namespace std;
int main(){
	int a,b,c,d,e;
	cin>>a>>b>>c>>d>>e;
	if(a>b)swap(a,b);
	if(b>c)swap(b,c);
	if(a>b)swap(a,b);
	if(d>e)swap(d,e);
	cout<<a+d-50<<endl;
	return 0;
	}

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

using namespace std;

int main(){

int a,b,c,d,e,pasta,juice;

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

pasta =a;

if(a>=b){
pasta=b;

if(b>=c){
pasta=c;}

}

juice=d;

if(d>=e)juice=e;

int sum=pasta+juice-50;

cout<<sum<<endl;

return 0;
}

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);
 
int aa = min(a,min(b,c));
 
int bb = min(d,e);
 
printf("%d\n",aa+bb-50);
return 0;
 
}

C++: #include <cstdio>
#include <cstring>
#include <cstdlib>
#include <cmath>
#include <complex>
#include <string>
#include <sstream>
#include <algorithm>
#include <vector>
#include <queue>
#include <stack>
#include <functional>
#include <iostream>
#include <map>
#include <set>
using namespace std;
typedef pair<int,int> P;
typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vll;
#define pu push
#define pb push_back
#define mp make_pair
#define eps 1e-9
#define INF 2000000000
#define sz(x) ((int)(x).size())
#define fi first
#define sec second
#define SORT(x) sort((x).begin(),(x).end())
#define all(x) (x).begin(),(x).end()
#define EQ(a,b) (abs((a)-(b))<EPS)
int main()
{
	vector<int> s,j;
	int k;
	for(int i=0;i<3;i++)
	{
		cin >> k;
		s.pb(k);
	}
	cin >> k;j.pb(k);
	cin >> k;j.pb(k);
	SORT(s);
	SORT(j);
	cout << s[0]+j[0]-50 << endl;
	return 0;
}

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

int main(){
int a,b,c,d,e,f;
cin>>a>>b>>c>>d>>e;
if(a>=b){
if(b>=c){
f=c;
}
if(b<=c){
f=b;
}
}
else{
if(a<=c){
f=a;
}
if(a>=c){
f=c;
}
}

if(d<=e){
cout<<f+d-50<<'\n';
}

if(d>e){
cout<<f+e-50<<'\n';
}

return 0;
}

C++: #include<iostream>

using namespace std;

int main(){

  int data[5];
  for(int i = 0; i < 5; i++) cin >> data[i];

  cout << min(data[0],min(data[1],data[2])) + min(data[3],data[4]) -50 << endl;
  return 0;
}

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

using namespace std;

#define FOR(i, j, k) for(int i = j; i < k; ++i)
#define rep(i, j) FOR(i, 0, j)
#define repr(i, j) for(int i = j; i >= 0; --i)
#define INF (1 << 30)
#define MOD 1e9 + 7

typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> P;

int main() {
	int pmin = INF, jmin = INF;
	rep(i, 3) {
		int p;
		scanf("%d", &p);
		pmin = min(pmin, p);
	}
	rep(i, 2) {
		int j;
		scanf("%d", &j);
		jmin = min(jmin, j);
	}
	printf("%d\n", pmin + jmin - 50);
	return 0;
}

C++: #include <iostream>

using namespace std;

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

	return 0;
}