Codeforces661 E1. Weights Division(easy version)(贪心+优先队列)
题目链接思路:先计算每条边被计算的次数,然后贪心地每次减半能减少最多花费的边,直到小于等于S为止。代码:#include<bits/stdc++.h>#define ll long long#define LL long long#define PB push_back#define MP make_pairusing namespace std;const int maxn=2e5+100;const ll inf=1e18+10;ll n,s,val[maxn],le
原创
2020-08-06 21:14:38 ·
115 阅读 ·
0 评论