| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 1283234 | LM1 | Festival (IOI25_festival) | C++20 | 0 ms | 0 KiB |
#include "festival.h"
#include <cassert>
#include <cstdio>
std::vector<int> max_coupons(int A, std::vector<int> P, std::vector<int> T) {
return {};
}
int main() {
int N, A;
assert(2 == scanf("%d %d", &N, &A));
std::vector<int> P(N), T(N);
for (int i = 0; i < N; i++)
assert(2 == scanf("%d %d", &P[i], &T[i]));
fclose(stdin);
std::vector<int> R = max_coupons(A, P, T);
int S = R.size();
printf("%d\n", S);
for (int i = 0; i < S; i++)
printf("%s%d", (i == 0 ? "" : " "), R[i]);
printf("\n");
fclose(stdout);
return 0;
}
