From 27ecded0928eae52a1d657854674a8c288e43a84 Mon Sep 17 00:00:00 2001
From: Zengtudor <Zengtudor@outlook.com>
Date: Tue, 26 Aug 2025 12:49:41 +0800
Subject: [PATCH] update

---
 src/8/26/P2782.cpp | 47 ++++++++++++++++++++++++++++++++++++++++++++++
 src/8/26/P5124.cpp | 28 +++++++++++++++++++++++++++
 2 files changed, 75 insertions(+)
 create mode 100644 src/8/26/P2782.cpp
 create mode 100644 src/8/26/P5124.cpp

diff --git a/src/8/26/P2782.cpp b/src/8/26/P2782.cpp
new file mode 100644
index 0000000..8252ca9
--- /dev/null
+++ b/src/8/26/P2782.cpp
@@ -0,0 +1,47 @@
+#include <algorithm>
+#include <cstdint>
+#include <functional>
+#include <iostream>
+#include <istream>
+#include <iterator>
+#include <ostream>
+#include <utility>
+#include <vector>
+
+using ll = int64_t;
+
+std::ostream& operator<<(std::ostream& os, const std::pair<ll, ll>& p){
+    os << "{ " << p.first << ", " << p.second << " }";
+    return os;
+}
+
+#define pa(a)do{for(auto v:(a)){std::cout<<v<<", ";}std::cout<<"\n";}while(0)
+
+int main(){
+    std::iostream::sync_with_stdio(false);
+    std::cin.tie(nullptr);
+    
+    ll n;
+    std::cin >> n;
+    std::vector<ll> c(n);
+    std::vector<std::pair<ll, ll>> input(n);
+    for (ll i = 0; i < n; i++){
+        std::cin >> input[i].first >> input[i].second;
+    }
+    std::sort(input.begin(), input.end());
+    for (ll i = 0; i < input.size(); i++){
+        c[i] = input[i].second;
+    }
+    std::vector<ll> f;
+    f.reserve(n);
+    for (ll x : c) {
+        auto it = std::lower_bound(f.begin(), f.end(), x);
+        if (it == f.end()) {
+            f.push_back(x);
+        } else {
+            *it = x;
+        }
+    }
+    std::cout << f.size() << std::endl;
+    return 0;
+}
diff --git a/src/8/26/P5124.cpp b/src/8/26/P5124.cpp
new file mode 100644
index 0000000..7df1f5e
--- /dev/null
+++ b/src/8/26/P5124.cpp
@@ -0,0 +1,28 @@
+#include <algorithm>
+#include <iostream>
+#include <istream>
+#include <numeric>
+#include <vector>
+
+using ll = int64_t;
+
+#define pv(v)do{std::cout<<#v<<": "<<(v)<<"\n";}while(0)
+
+int main(){
+    std::iostream::sync_with_stdio(false);
+    std::cin.tie(nullptr);
+
+    ll n,k;
+    std::cin>>n>>k;
+    std::vector<ll> v(n);
+    for(ll&i:v){
+        std::cin>>i;
+    }
+    std::sort(v.begin(),v.end());
+    ll teams=n/k,last=n%k;
+    ll teamssum = std::accumulate(v.rbegin(),v.rbegin()+teams,0);
+    // pv(teams);
+    // pv(teamssum);
+    // pv(last);
+    std::cout<<(last * (*(v.rbegin()+teams)) + teamssum*k)<<"\n";
+}
\ No newline at end of file