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>
#include<vector>

const int PASTA_COUNT = 3;
const int JUICE_COUNT = 2;
const int DISCOUNT_PRICE = 50;

class Lunch {
private:
    std::vector<int> pastaPrice;
    std::vector<int> juicePrice;
public:
    Lunch(std::vector<int> pasta,std::vector<int> juice);
    int getLowPrice(std::vector<int> vec);
    int getLowCostSet();
};

Lunch::Lunch(std::vector<int> pasta,std::vector<int> juice){
    this->pastaPrice = pasta;
    this->juicePrice = juice;
}

int Lunch::getLowPrice(std::vector<int> vec){
    int resultPrice = vec[0];

    for(int price : vec){
        if(price < resultPrice){
            resultPrice = price;
        }
    }
    return resultPrice;
}

int Lunch::getLowCostSet(){
    int resultCost = 0;
    
    resultCost = getLowPrice(pastaPrice) + getLowPrice(juicePrice) - DISCOUNT_PRICE;
    return resultCost;
}

int main(){
    
    std::vector<int> pasta;
    std::vector<int> juice;

    //PASTA
    for(int i = 0;i < PASTA_COUNT;i++){
        int input = 0;
        std::cin >> input;
        pasta.push_back(input);
    }

    //JUICE
    for(int i = 0;i < JUICE_COUNT;i++){
        int input = 0;
        std::cin >> input;
        juice.push_back(input);
    }

    Lunch l = Lunch(pasta,juice);

    std::cout << l.getLowCostSet() << std::endl;

    return 0;
}

C++: #include<iostream>
using namespace std;
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;
}

C++: #include <iostream>
#include <algorithm>
using namespace std;
int main()
{
	int a[3], b[2];
	cin >> a[0] >> a[1] >> a[2] >> b[0] >> b[1];
	sort(a, a+3);
	sort(b, b+2);
	cout << a[0] + b[0] - 50 << endl;
}

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

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

C++: #include<bits/stdc++.h>
using namespace std;
int main(){
    int n;
    vector<int> vc;
    for(int i=0; i<=4; i++){
        cin >> n;
        vc.push_back(n);     
    }
    sort(vc.begin(),vc.begin()+3);
    sort(vc.begin()+3,vc.end());
    cout << vc[0]+vc[3]-50 <<endl;
    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;
}

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;
	return 0;
}

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

int main()
{
  
  int sp[3],ju[2];

  while(cin>>sp[0]>>sp[1]>>sp[2]>>ju[0]>>ju[1]){
    int mini = 1<<26;
    for(int i = 0; i < 3; ++i){
      for(int j = 0; j < 2; ++j){
        mini  = min(mini, sp[i] + ju[j] - 50);
      }
    }
    cout << mini << endl;
  }
  return 0;
}

C++: #include<iostream>
using namespace std;
int main()
{
    int min;
    int n;
    int min1;
    int flg = 0;

    for(int i = 0; i < 3; i++){
        cin >> n;
        if(flg == 1){
            if(min > n) min = n;
        }
        else{
            min = n;
            flg = 1;
        }
    }
    flg = 0;
    for(int i = 0; i < 2; i++){
        cin >> n;
        if(flg == 1){
            if(min1 > n) min1 = n;
        }
        else{
            min1 = n;
            flg = 1;
        }
    }
    cout << min + min1 - 50 << endl;

    return 0;
}

C++: #include<iostream>
#include<vector>
#include<algorithm>
#include<math.h>
#include<stdlib.h>
#include<cstdlib>
using namespace std;

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

C++: #include<iostream>
using namespace std;
int main(void){
  int minpas=3000,minju=3000,pas,ju;
  for(int i=0;i< 3;i++){
    cin >> pas;
    minpas = (minpas > pas)?pas:minpas;
  }for(int i=0;i<2;i++){
    cin >> ju;
    minju = (minju > ju)?ju:minju;
  }int synthetic=0;
  synthetic = minju+minpas -50;
  cout << synthetic << endl;
}

C++: #include <iostream>
using namespace std;
int main() {
  int p1, p2, p3, j1, j2, min, sum = 0;
  cin >> p1 >> p2 >> p3;
  min = (p1 <= p2 ? p1 : p2);
  sum += (min <= p3 ? min : p3);
  cin >> j1 >> j2;
  sum += (j1 <= j2 ? j1 : j2) - 50;
  cout << sum << endl;
  return 0;
}

C++: #include<iostream>
using namespace std;
int main(){
	int a[3];
	int i=0;
	int b[2];
	int c=0;
	int d=0;
	for(i=0;i<3;i++){
		cin>>a[i];
	}
	cin>>b[0];
	cin>>b[1];
	if(a[0]<a[1]){
		c=a[0];
	}else{
		c=a[1];
	}
	if(a[2]<c){
		c=a[2];
	}
	if(b[0]<b[1]){
		d=c+b[0]-50;
	}else{
		d=c+b[1]-50;
	}
	cout<<d<<endl;
}

C++: #include <iostream>
#include <stdio.h>
#include <string.h>
#include <functional>
#include <algorithm>
#include <string>
#include <vector>
#include <algorithm>
#include <time.h>
#include <stdlib.h>

using namespace std;

int main (void)
{
	int a[2000],co,d,e;

	co = 3000;
	for (int i = 0; i < 3; i++)
	{
		cin >> a[i];

		if (a[i] < co)
		{
			co = 0;
			co = a[i];
		}
	}
	cin >> d >> e;

	if (d <= e)
	{
		cout << co + d - 50 << endl;
	}
	else if (d > e)
	{
		cout << co + e - 50 << endl;
	}
}

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

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

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

using namespace std;

int main()
{
	int a,b,c,d,e,f,g,h;
	cin>>a;
	cin>>b;
	cin>>c;
	cin>>d;
	cin>>e;
	if(e<d)
	{
		f=e-50;
		if(a<b)
		{
			if(a<c){cout<<a+f<<endl;}
			else{cout<<c+f<<endl;}
		}
		else
		{
			if(b<c){cout<<b+f<<endl;}
			else{cout<<c+f<<endl;}
		}
	}
	else
	{
		f=d-50;
		if(a<b)
		{
			if(a<c){cout<<a+f<<endl;}
			else{cout<<c+f<<endl;}
		}
		else
		{
			if(b<c){cout<<b+f<<endl;}
			else{cout<<c+f<<endl;}
		}
		
	}
    
	return 0;

}

C++: /*
	lunch
*/
#include<iostream>
#include<cstdio>
#include<algorithm>


using namespace std;

int main(void)
{
	//freopen("C:\\Users\\h2539\\Desktop\\in.txt","r",stdin);
	//freopen("C:\\Users\\h2539\\Desktop\\out.txt","w",stdout);

	int p[3] = {0}, d[2] = {0};

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

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

	int maxp = max(p[0], p[1]);
	maxp = max(maxp, p[2]);

	int maxd = max(d[0], d[1]);

	cout << (maxp + maxd - 50) << endl;

	return 0;
}

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

using namespace std;

int main()
{
	int pa[3], ju[2],sum=0;
	for (int i = 0; i < 3; i++) {
		cin >> pa[i];
	}for (int i = 0; i < 2; i++) {
		cin >> ju[i];
	}
	sort(pa, pa + 3);
	sort(ju, ju + 2);

	sum = pa[0] + ju[0] - 50;
	
	cout << sum << endl;

	return 0;
}

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

C++: #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
    int p1, p2, p3;
    int j1, j2;
    cin >> p1 >> p2 >> p3 >> j1 >> j2;
    cout << min(p1, min(p2, p3)) + min(j1, j2) - 50 << "\n";
    return 0;
}