Submission #1312499

#TimeUsernameProblemLanguageResultExecution timeMemory
1312499DedibeatFestival (IOI25_festival)C++20
0 / 100
62 ms9576 KiB
#include "festival.h"
#include <bits/stdc++.h>
using namespace std;
std::vector<int> max_coupons(int A, std::vector<int> P, std::vector<int> T) {
  int n = T.size();
  vector<int> o(n);
  for(int i = 0; i < n; i++)
  {
    o[i] = i;
  }
  sort(o.begin(), o.end(), [&](int i, int j)
  {
    if(T[i] == T[j]) return P[i] < P[j];
    return T[i] > T[j];
  });
  return o;
}
#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...