Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <iostream>
- #include <queue>
- using namespace std;
- int main() {
- double answer = 1000000, min_first_part, curr;
- queue<double> waiting;
- cin >> min_first_part;
- for (int i = 0; i != 5; ++i) {
- cin >> curr;
- waiting.push(curr);
- }
- while (cin >> curr) {
- answer = min(answer, min_first_part * curr);
- min_first_part = min(min_first_part, waiting.front());
- waiting.pop();
- waiting.push(curr);
- }
- cout << answer << '\n';
- return 0;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement