제출 #1263581

#제출 시각아이디문제언어결과실행 시간메모리
1263581gelastropod축제 (IOI25_festival)C++20
27 / 100
68 ms7608 KiB
#include "festival.h"

#include <bits/stdc++.h>
using namespace std;

bool comp(pair<int, pair<int, int>> a, pair<int, pair<int, int>> b) {
	return (long long)a.second.first * a.second.second * b.second.second + (long long)b.second.first * b.second.second <
		(long long)b.second.first * a.second.second * b.second.second + (long long)a.second.first * a.second.second;
}

std::vector<int> max_coupons(int A, std::vector<int> P, std::vector<int> T) {
	vector<pair<int, pair<int, int>>> vals;
	for (int i = 0; i < P.size(); i++) {
		vals.push_back({ i, { P[i], T[i] } });
	}
	sort(vals.begin(), vals.end(), comp);
	vector<int> ans;
	for (auto i : vals) ans.push_back(i.first);
	return ans;
}
#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...