Submission #1255954

#TimeUsernameProblemLanguageResultExecution timeMemory
1255954Aviansh축제 (IOI25_festival)C++20
0 / 100
63 ms6472 KiB
#include "festival.h"
#include <bits/stdc++.h>

using namespace std;

bool comp(array<int,3>&a, array<int,3>&b){
    if(a[0]*a[1]*b[1]+b[0]*b[1]==b[0]*a[1]*b[1]+a[0]*a[1]){
        return a[0]<b[0];
    }
    return a[0]*a[1]*b[1]+b[0]*b[1]<b[0]*a[1]*b[1]+a[0]*a[1];
}

vector<int> max_coupons(int A, vector<int> P, vector<int> T) {
    int n = P.size();
    array<int,3>arr[n];
    for(int i = 0;i<n;i++){
        arr[i]={P[i],T[i],i};
    }
    sort(arr,arr+n,comp);
    vector<int>ans(n);
    for(int i = 0;i<n;i++){
        ans[i]=arr[i][2];
    }
    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...