| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
|---|---|---|---|---|---|---|---|
| 1345727 | ElayV13 | 축제 (IOI25_festival) | C++20 | 30 ms | 5680 KiB |
#include "festival.h"
#include "bits/stdc++.h"
using namespace std;
vector<int>max_coupons(int A,vector<int>P,vector<int>T)
{
int n=P.size();
vector<pair<int,int>>srt;
for(int i=0;i<n;i++) srt.push_back({P[i],i});
sort(srt.begin(),srt.end());
vector<int>res;
for(int i=0;i<n;i++){
if(A>=srt[i].first){
res.push_back(srt[i].second);
A-=srt[i].first;
}
}
return res;
}
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
