摘要：
A #include <bits/stdc++.h> using namespace std; int n, k; struct node { int a, b; }p[110]; bool cmp(node x, node y) { if (x.a == y.a) return x.b > y.b 阅读全文
posted @ 2022-01-23 16:05
Angels_of_Death
阅读(29)
评论(0)
推荐(0)
摘要：
A class Solution { public: int minimumCost(vector<int>& cost) { sort(cost.begin(), cost.end()); vector<int> v; int sum = 0; for (int i = cost.size() - 阅读全文
posted @ 2022-01-23 14:33
Angels_of_Death
阅读(35)
评论(0)
推荐(0)
摘要：
A class Solution { public: int countElements(vector<int>& nums) { int minn = 0x3f3f3f3f, maxx = 0xcfcfcfcf; for (auto x : nums) minn = min(minn, x), m 阅读全文
posted @ 2022-01-23 12:01
Angels_of_Death
阅读(28)
评论(0)
推荐(0)
浙公网安备 33010602011771号