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 p[3] = {0};
    int pmin = 9999;
    int j[2] = {0};
    int jmin = 9999;
    for(int i = 0;i < 3;i++){
        cin >> p[i];
        if(p[i] <= pmin){
            pmin = p[i];
        }
    }
    for(int i = 0;i < 2;i++){
        cin >> j[i];
        if(j[i] <= jmin){
            jmin =j[i];
        }
    }
    cout << pmin+jmin-50 << endl;
}

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

C++: #include <iostream>

using namespace std;

int main(){
	
	int a;
	int b;
	int c;
	cin >> a;
	cin >> b;
	cin >> c;

	int k = a;
	if (a > b) {
		k = b;
		if (b > c) {
			k = c;
		}
	}
	if (a > c) {
		k = c;
	}
    
	int p;
	int q;

	cin >> p;
	cin >> q;
	 
	int n = p;
	if (p > q) {
		n = q;
	}
	int sum = k + n -50;
	cout << sum << endl;

	return 0;
}

C++: #include<iostream>
using namespace std;
int main(){
	int a,b,c,d,e;
	int A=0;
	int B=0;
	cin>>a>>b>>c>>d>>e;
	if(a>b&&b>c){
	A=c;
	}
	else if(b>c&&c>a){
		A=a;
	}
	else{
		A=b;
	}

	if(d>e){
		B=e;
	}
	else {
		B=d;
	}
	cout<<A+B-50<<endl;
	return 0;
}

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

using namespace std;

main(){
	int a,b,c,d,e;
	int k=0;
	int l=0;
	cin >>a >>b >>c >>d >>e;
	if (a < b && a < c){
		k=k+a;
	}
	else if (b < a && b < c){
		k=k+b;
	}
	else{
		k=k+c;
	}
	if (e > d){
		l=l+d;
	}
	else {
		l=l+e;
	}
	int g=k+l-50;
	printf("%d\n",g);
	}

C++: #include <stdio.h>
#include <algorithm>

int main(){
int a,b,A=9999,B=9999;
for(int i=0;i<3;i++)scanf("%d",&a),A=min(A,a);
for(int i=0;i<2;i++)scanf("%d",&b),B=min(B,b);
printf("%d\n",A+B-50);
}

C++: #include<stdio.h>
int main()
{
	int a[3],b[2],r=0;
	int i;
	for(i=0;i<3;i++){
		scanf("%d",&a[i]);
	}
	if(a[0]<a[1]&&a[0]<a[2]){
		r+=a[0];
	}else if(a[0]>a[1]&&a[2]>a[1]){
		r+=a[1];
	}else{
		r+=a[2];
	}
	for(i=0;i<2;i++){
		scanf("%d",&b[i]);
	}
	if(b[0]>b[1]){
		r+=b[1];
	}else{
		r+=b[0];
	}
	printf("%d\n",r-50);
	return 0;
}

C++: #include<iostream>

using namespace std;

int main(){

  int pmin,jmin,inp;

  cin>>pmin;
  cin>>inp;
  if(inp<pmin) pmin=inp;

  cin>>inp;
  if(inp<pmin) pmin=inp;

  cin>>jmin;
  cin>>inp;
  if(jmin>inp) jmin=inp;

  cout<<pmin+jmin-50<<endl;

}

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<bits/stdc++.h>
using namespace std;
int main()
{
  int pasta[3];
  int juce[2];

  for(int i = 0;i < 3;i++)cin >> pasta[i];
  for(int i = 0;i < 2;i++)cin >> juce[i];

  sort(pasta,pasta + 3);
  sort(juce,juce + 2);
  
  int ans = pasta[0] + juce[0] - 50;
  cout << ans << endl;
}

C++: #include<iostream>
using namespace std;
int main(void){
	int a[5000], b, c, g = 0, h = 0, i, g1[5000]={0}, g2[5000]={0};
	for(i=0;i<3;i++){	
		cin >> a[i];
	}
	cin >> b >> c;
	for(i=0;i<3;i++){	
		g1[i] = a[i] + b - 50;
		g2[i] = a[i] + c - 50;
	}
	if(g1[0] < g1[1]){
		 g = g1[0];
	}	
	else{
		 g = g1[1];
	}
	if(g > g1[2]){
		 g = g1[2];
	}	
	if(g2[0] < g2[1]){
 		 h = g2[0];	
	}
	else{
		 h = g2[1];
	}
	if(h > g2[2]){
		 h = g2[2];
	}
	if(g < h){
		 cout << g;
	}
	else{
		 cout << h << 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;
		}
	}
	cout << ans + min;
	return 0;
}

C++: #include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
typedef long long int ll;


int main(){
	cin.tie(nullptr);
	ios::sync_with_stdio(false);
	int a[3],b[2];
	for(int i=0;i<3;i++){
		cin >> a[i];
	}
	for(int i=0;i<2;i++){
		cin >> b[i];
	}
	sort(a,a+3);
	sort(b,b+2);
	cout << a[0]+b[0]-50 << endl;
}

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

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

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 << endl;
}

C++: #include <iostream>
#include <algorithm>
using namespace std;
int main() {  
  int menu[5], sum;  
  for(int i=0; i<5; i++) { 
    cin >> menu[i]; 
  }   
  sum = *min_element(menu, menu+3);
  sum+= *min_element(menu+3, menu+5); 
  sum-= 50;  
  cout << sum << 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[a]){
				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];
	for(i=0;i!=3;i++)
		cout<<p[i]<<endl;
	cout<<t-50<<endl;
}

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

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

int p[3], q[2];
int res = 1E8;

int main(int argc, char *argv[])
{
  rep(i, 3) cin >> p[i];
  rep(i, 2) cin >> q[i];

  rep(i, 3) rep(j, 2) res = min(res, p[i] + q[j] - 50);

  cout << res << endl;
  
  return 0;
}

C++: #include <stdio.h>
#include <stack>
#include <math.h>

using namespace std;



int main(){

	int a,b,c,d,e;

	scanf("%d\n%d\n%d\n%d\n%d",&a,&b,&c,&d,&e);

	printf("%d\n",min(a,min(b,c))+min(d,e)-50);

    return 0;
}