Submission #1540301


Source Code Expand

Copy
#include <iostream>
#include <vector>
#include <algorithm>

using namespace std;

int main()
{
  vector<pair<double, double> > v;
  vector<double> w =  { 0.25, 0.5, 1.0, 2.0 };
  for ( int i = 0; i < 4; i++ ) {
    int t;
    cin >> t;
    v.push_back( make_pair( t / w[i], i ) );
  }

  int n;
  cin >> n;

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

  long long c = 0;
  for ( auto& e : v ) {
    int a = n / w[e.second];
    n -= a * w[e.second];
    c += a * e.first * w[e.second];
  }

  cout << c << endl;

  return 0;
}

Submission Info

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

Judge Result

Set Name Score / Max Score Test Cases
Sample 0 / 0 sample_01.txt, sample_02.txt, sample_03.txt, sample_04.txt
All 0 / 300 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 1 ms 256 KB
sample_02.txt 1 ms 256 KB
sample_03.txt 1 ms 256 KB
sample_04.txt 1 ms 256 KB
subtask_1_01.txt 1 ms 256 KB
subtask_1_02.txt 1 ms 256 KB
subtask_1_03.txt 1 ms 256 KB
subtask_1_04.txt 1 ms 256 KB
subtask_1_05.txt 1 ms 256 KB
subtask_1_06.txt 1 ms 256 KB
subtask_1_07.txt 1 ms 256 KB
subtask_1_08.txt 1 ms 256 KB
subtask_1_09.txt 1 ms 256 KB
subtask_1_10.txt 1 ms 256 KB
subtask_1_11.txt 1 ms 256 KB
subtask_1_12.txt 1 ms 256 KB
subtask_1_13.txt 1 ms 256 KB
subtask_1_14.txt 1 ms 256 KB
subtask_1_15.txt 1 ms 256 KB