Submission #2384334


Source Code Expand

#include <iostream>
#include <algorithm>
#include <vector>
using namespace std;

long long n, q, h, s, d, res;
vector<pair<long long, pair<int, double>>> v;

int main() {
	cin >> q >> h >> s >> d >> n;

	v.push_back({ q * 8,{q, 0.25 } });
	v.push_back({ h * 4, {h, 0.5} });
	v.push_back({ s * 2, {s, 1} });
	v.push_back({ d, {d, 2} });

	sort(v.begin(), v.end());

	for (int i = 0; i < 4 && n > 0; ++i) {
		res += (long long)(n / v[i].second.second)*v[i].second.first;
		n -= (long long)(n / v[i].second.second)*v[i].second.second;
		//cout << res <<' ' << n << '\n';
	}

	cout << res;
}

Submission Info

Submission Time
Task A - Ice Tea Store
User nywoo19
Language C++14 (GCC 5.4.1)
Score 300
Code Size 612 Byte
Status AC
Exec Time 1 ms
Memory 256 KB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 300 / 300
Status
AC × 4
AC × 23
Set Name Test Cases
Sample sample_01.txt, sample_02.txt, sample_03.txt, sample_04.txt
All sample_01.txt, sample_02.txt, sample_03.txt, sample_04.txt, sample_01.txt, sample_02.txt, sample_03.txt, sample_04.txt, subtask_1_01.txt, subtask_1_02.txt, subtask_1_03.txt, subtask_1_04.txt, subtask_1_05.txt, subtask_1_06.txt, subtask_1_07.txt, subtask_1_08.txt, subtask_1_09.txt, subtask_1_10.txt, subtask_1_11.txt, subtask_1_12.txt, subtask_1_13.txt, subtask_1_14.txt, subtask_1_15.txt
Case Name Status Exec Time Memory
sample_01.txt AC 1 ms 256 KB
sample_02.txt AC 1 ms 256 KB
sample_03.txt AC 1 ms 256 KB
sample_04.txt AC 1 ms 256 KB
subtask_1_01.txt AC 1 ms 256 KB
subtask_1_02.txt AC 1 ms 256 KB
subtask_1_03.txt AC 1 ms 256 KB
subtask_1_04.txt AC 1 ms 256 KB
subtask_1_05.txt AC 1 ms 256 KB
subtask_1_06.txt AC 1 ms 256 KB
subtask_1_07.txt AC 1 ms 256 KB
subtask_1_08.txt AC 1 ms 256 KB
subtask_1_09.txt AC 1 ms 256 KB
subtask_1_10.txt AC 1 ms 256 KB
subtask_1_11.txt AC 1 ms 256 KB
subtask_1_12.txt AC 1 ms 256 KB
subtask_1_13.txt AC 1 ms 256 KB
subtask_1_14.txt AC 1 ms 256 KB
subtask_1_15.txt AC 1 ms 256 KB