传送门

按价格排序后贪心

——代码

1 #include <cstdio> 2 #include <iostream> 3 #include <algorithm> 4 5 int n; 6 long long m, ans; 7 struct node 8 p[100001]; 11 12 inline long long read() 13 20 21 inline bool cmp(node x, node y) 22 25 26 int main() 27 42 else 43 47 } 48 printf("%lld\n", ans); 49 return 0; 50 }
View Code