# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
438982 | 2021-06-29T02:53:41 Z | jlozano254 | Distributing Candies (IOI21_candies) | C++17 | 0 ms | 0 KB |
std::vector<int> distribute_candies(std::vector<int> c, std::vector<int> l, std::vector<int> r, std::vector<int> v) { int n = c.size(); std::vector<int> s; long long int acum = 0; for (int i = 0; i < v.size(); ++i) acum += v[i]; for (int i = 0; i < n; ++i) s.push_back(std::min((int) acum, c[i])); return s; }