| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
|---|---|---|---|---|---|---|---|
| 546692 | 2022-04-08T07:44:19 Z | srivatsav_kannan | Roses (BOI20_roses) | C++14 | 0 ms | 0 KB |
#include <iostream>
#include <fstream>
#include <vector>
#include <set>
#include <queue>
#include <cmath>
#include <map>
#include <algorithm>
#include <numeric>
#include <stack>
#include <cstring>
#include <bitset>
#include <climits>
#include <valarray>
#include <list>
#define int long long
#define inf 1000000000
#define endl '\n'
#define mod 1000000007
using namespace std;
signed main(){
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
int n,a,b,c,d; cin >> n >> a >> b >> c >> d;
if (a*b > c*d){
swap(a, c);
swap(b, d);
}
long long double nn = n, aa = a, cc = c;
int mn = inf;
for (int i = 0; i <= ceil(nn/aa); i++){
int sec = n - (i*aa);
int fir = 0;
if (sec > 0){
long long double secc = sec;
fir = ceil(secc/cc);
}
mn = min(mn, (fir*d)+(i*b));
}
cout << mn << endl;
}