AcWing 145. 超市

//
// Created by Kaede on 2022/5/17
// Problem: Acwing 145
//

#include <algorithm>
#include <cstdio>
#include <cstdlib>
#include <iostream>
#include <map>
#include <vector>

namespace DisjointSet {
class disjointSet {
  public:
    static const uint64_t SIZE = 1000000;
    uint64_t n;
    std::map<uint64_t, uint64_t> fa;

    void initialize() {
        fa.erase(fa.begin(), fa.end());
    }

    uint64_t get(uint64_t x) {
        if (fa.count(x) == 0) fa[x] = x;
        return fa[x] == x ? x : fa[x] = get(fa[x]);
    }

    void joint(uint64_t x, uint64_t y) {
        uint64_t fa_x = get(x), fa_y = get(y);
        if (fa_x < fa_y) {
            fa[fa_y] = fa_x;
        } else {
            fa[fa_x] = fa_y;
        }
    }
} s; // class disjointSet
} // namespace DisjointSet

using namespace DisjointSet;

int main() {
    std::ios::sync_with_stdio(false);
    while (std::cin >> s.n) {
        s.initialize();
        std::vector <std::pair<uint64_t, uint64_t> > goods(s.n);
        for (uint64_t i = 0; i < s.n; ++i) {
            std::cin >> goods[i].first >> goods[i].second;
        }
        std::sort(goods.begin(), goods.end(), [&](
            const std::pair<uint64_t, uint64_t> &x, 
            const std::pair<uint64_t, uint64_t> &y) {
                return x.first > y.first;
            });
        uint64_t ans = 0;
        for (uint64_t i = 0; i < s.n; ++i) {
            uint64_t date = s.get(goods[i].second);
            if (date > 0) {
                s.joint(date, date - 1);
                ans += goods[i].first;
            }
        }
        std::cout << ans << std::endl;
    }
    return 0;
}

标签：uint64,std,145,get,超市,fa,goods,include,AcWing
来源： https://www.cnblogs.com/Practise/p/16281466.html