제출 #1339257

#제출 시각아이디문제언어결과실행 시간메모리
1339257khanhphucscratch축제 (IOI25_festival)C++20
27 / 100
73 ms4660 KiB
#include "festival.h"
#include<bits/stdc++.h>
using namespace std;
const long long lim = 1e18;
vector<int> max_coupons(int B, vector<int> P, vector<int> T) {
    long long A = B;
    //Subtask 5
    int n = P.size();
    vector<int> order;
    for(int i = 0; i < n; i++) order.push_back(i);
    sort(order.begin(), order.end(), [&](const int x, const int y){
        if(T[x] == T[y]) return P[x] < P[y];
        else return (long long)P[x]*T[x]*(T[y]-1) < (long long)P[y]*T[y]*(T[x]-1);
    });
    return order;
}
#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...