Submission #1257034

#	Time	Username	Problem	Language	Result	Execution time	Memory
1257034		ogkostya	축제 (IOI25_festival)	C++20	5 / 100	39 ms	4936 KiB

festival

#include "festival.h"
#include <algorithm>

std::vector<int> max_coupons(int A, std::vector<int> P, std::vector<int> T)
{
  int n = P.size();
  std::vector<std::pair<int, int>> x = std::vector<std::pair<int, int>>(n);
  for (int i = 0; i < n; i++)
    x[i] = std::make_pair(P[i], i);

  std::sort(x.begin(), x.end());
  std::vector<int> ans = {};
  for (int i = 0; i < n; i++)
  {
    if (A >= x[i].first)
    {
      ans.push_back(x[i].second);
      A -= x[i].first;
    }
    else
      break;
  }

  return ans;
}

• Subtask 0: 0 / 0
• Subtask 1: 5 / 5
• Subtask 2: 0 / 7
• Subtask 3: 0 / 12
• Subtask 4: 0 / 15
• Subtask 5: 0 / 27
• Subtask 6: 0 / 16
• Subtask 7: 0 / 18