priority_queue<int> q;//这里用优先队列存储intn; cin >> n;intm = n * (n -1) /2;for(inti =1; i <= m; i++) {intx; cin >> x; q.push(-x);//从小到大升序,因为优先队列默认是大根堆,也就是从大到小排序,取-就从小到大了}vector<int>ans(n+1);for(inti = n -1;i>=1;...
1857C-AssemblyViaMinimums.cpp 1857D-StrongVertices.cpp 1858A-Buttons.cpp 1858C-YetAnotherPermutationProblem.cpp 1859A-UnitedWeStand.cpp 1859B-OlyaAndGameWithArrays.cpp 1860A-NotASubstring.cpp 1860B-FancyCoins.cpp 1861A-PrimeDeletion.cpp 1861B-TwoBinaryStrings.cpp 1862A-GiftCarpet.cpp 1862B-Seque...