| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
|---|---|---|---|---|---|---|---|
| 1317870 | linhhnt11072010 | 축제 (IOI25_festival) | C++20 | 38 ms | 5668 KiB |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
vector<int> max_coupons(int a, vector<int> p, vector<int> t){
ll ch1 = 1;
ll n = t.size();
vector<int> kq;
for(int i = 0;i<n;i++){
if(t[i]!=1){
ch1 = 0;
break;
}
}
if(ch1 == 1){
ll ans = 0;
vector<pair<int, int> > p1;
for(int i = 0;i<n;i++) p1.push_back(make_pair(p[i], i));
sort(p1.begin(), p1.end());
for(int i = 0;i<n;i++){
ans+=p1[i].first;
if(ans<=a) kq.push_back(p1[i].second);
else break;
}
return kq;
}
}
컴파일 시 표준 에러 (stderr) 메시지
| # | 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... | ||||
