제출 #1320550

#제출 시각아이디문제언어결과실행 시간메모리
1320550yeyso2축제 (IOI25_festival)C++20
5 / 100
38 ms6696 KiB
#include "festival.h" using namespace std; #include <bits/stdc++.h> std::vector<int> max_coupons(int A, std::vector<int> P, std::vector<int> T) { struct Coupon { int cost; int type; int index; bool operator<(const Coupon& other) const { if (cost != other.cost) return cost < other.cost; return type > other.type; } }; vector<Coupon> coupons; for(int i = 0; i < P.size(); i ++){ coupons.push_back({P[i], T[i], i}); } sort(coupons.begin(), coupons.end()); vector<int> res; for(int i = 0; i < coupons.size(); i ++){ if(A > coupons[i].cost){ A -= coupons[i].cost; res.push_back(coupons[i].index); } } return res; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...