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

int cleanupDataset(string dataset, int x, int y) {
    int freq[26] = {0};
    for(char c : dataset) {
        freq[c - 'a']++;
    }
   
    long long s_max = 0;
    for(int i = 0; i < 26; i++) {
        s_max += freq[i] / 2;
    }
   
    long long N = dataset.length() / 2;
   
    if(x <= y){
        long long cost = s_max * (long long)x + (N - s_max) * (long long)y;
        return (int)cost;
    }
    else{
        long long cost = N * (long long)y;
        return (int)cost;
    }
}

Amazon ✅