Submission #1539937

---

Source Code Expand

#include<iostream>
#include <cstdio>
#include <iostream>
#include <cstring>
#include <string>
#include <cmath>
#include <queue>
#include <set>
#include <map>
#include <complex>
#include <algorithm>
#include <vector>

using namespace std;
typedef long long ll;
typedef long double db;
typedef pair<int,int> pii;
typedef vector<int> vi;
#define de(x) cout << #x << "=" << x << endl
#define rep(i,a,b) for(int i=a;i<(b);++i)
#define all(x) (x).begin(),(x).end()
#define sz(x) (int)(x).size()
#define mp make_pair
#define pb push_back
#define fi first
#define se second
int main()
{
	int d25,d50,d100,d200;
	cin>>d25>>d50>>d100>>d200;
	ll n;
	cin>>n;
	n*=100;
	if(d50>2*d25)
	d50=2*d25;
	if(d100>d50*2)
	d100=2*d50;
	if(d200>2*d100)
	d200=2*d100;
	ll ans=0;
	if(n>=200)
	{
		ans+=(n/200)*d200;
		n%=200;
	}
	if(n>=100)
	{
		ans+=(n/100)*d100;
		n%=100;
	}
	if(n>=50)
	{
		ans+=(n/50)*d50;
		n%=50;
	}
	
	if(n>=25)
	{
		ans+=(n/25)*d50;
		n%=25;
	}
	cout<<ans<<endl;
	return 0;
}

Submission Info

Judge Result