| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
|---|---|---|---|---|---|---|---|
| 1265824 | thenpc | 축제 (IOI25_festival) | C++20 | 41 ms | 5560 KiB |
#include <bits/stdc++.h>
#include "festival.h"
using namespace std;
#define ll long long
vector<int> max_coupons(int a,vector<int> p,vector<int> t){
vector<pair<int,int>> v;
vector<int> u;
for(int i=0;i<p.size();i++){
v.push_back({p[i],i});
}
sort(v.begin(),v.end());
for(int i=0;i<v.size();i++){
if(a>=v[i].first){
a-=v[i].first;
u.push_back(v[i].second);
}
else{
break;
}
}
return u;
}| # | 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... | ||||
