제출 #1316332

#제출 시각아이디문제언어결과실행 시간메모리
1316332ezzzay축제 (IOI25_festival)C++20
27 / 100
59 ms4324 KiB
//#include "festival.h"
#include<bits/stdc++.h>
using namespace std;
#define pb push_back
#define ff first
#define ss second
#define ll long long
std::vector<int> max_coupons(int A, std::vector<int> P, std::vector<int> T) {
  int n = P.size();
  vector<int> order(n);
  for(int i = 0; i < n; i++)
  {
    order[i] = i;
  }
  sort((order).begin(), (order).end(), [&](int i, int j)
  {
    ll x = P[i], y = P[j], t1 = T[i], t2 = T[j];
    return t1 * t2 * x + y * t2 < t1 * t2 * y + x * t1;
  });
  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...