Submission #1540594

---

Source Code Expand

#include <iostream>
#include <vector>
#include <algorithm>
#include <unordered_map>
#include <unordered_set>
#include <set>
#include <map>
#include <iomanip>
#include <climits>
#include <cmath>
#include <queue>
#define ll long long int
#define MOD 1000000007
#define IOS ios::sync_with_stdio(false)  ;cin.tie()  ; cout.tie() ;
#define MAX 100001
using namespace std;
ll q  ,  h , s , d   ;
ll n   ;



 int main(){
   IOS  ;

   cin>>q>>h>>s>>d ;
   ll a = q*4  ,b = h*2  ,c = s  ;
   cin>>n  ;

   q *= 8  ;
   h *= 4 ;
   s *= 2 ;

   ll p =  min( min(q,h)  , min(s,d) ) ;

   if(n % 2 ==0 )
   cout<<n/2 * p;
    else
   {
     ll ans = 0  ;

         ans = (n-1)/2 *  p ;


       ll m = min(min(a,b) , c )  ;

         ans += m ;
         cout<<ans  ;


   }









    return 0;
}

Submission Info

Judge Result