Merge pull request #399 from xirc/atcoder/abc009

AtCoder/ABC009

Author: xirc

atcoder/abc009/A/main.cpp

@@ -0,0 +1,16 @@
+#include <bits/stdc++.h>
+
+using namespace std;
+using ll = int64_t;
+using ff = long double;
+
+int main() {
+    ios_base::sync_with_stdio(false);
+    cin.tie(0); cout.tie(0);
+
+    int N;
+    cin >> N;
+    cout << (N + 1) / 2 << endl;
+
+    return 0;
+}

atcoder/abc009/B/main.cpp

@@ -0,0 +1,25 @@
+#include <bits/stdc++.h>
+
+using namespace std;
+using ll = int64_t;
+using ff = long double;
+
+int main() {
+    ios_base::sync_with_stdio(false);
+    cin.tie(0); cout.tie(0);
+
+    int N;
+    vector<int> A;
+    
+    cin >> N;
+    A.assign(N, 0);
+    for (auto &a : A) cin >> a;
+
+    sort(A.begin(), A.end());
+    auto it = unique(A.begin(), A.end());
+    A.erase(it, A.end());
+    reverse(A.begin(), A.end());
+    cout << A[1] << endl;
+
+    return 0;
+}

atcoder/abc009/C/main.cpp

@@ -0,0 +1,43 @@
+#include <bits/stdc++.h>
+
+using namespace std;
+using ll = int64_t;
+using ff = long double;
+
+int diff(string const& S, string const& R) {
+    assert(S.size() == R.size());
+    int count = 0;
+    for (int i = 0; i < (int)S.size(); ++i) {
+        count += S[i] != R[i] ? 1 : 0;
+    }
+    return count;
+}
+
+string solve(int const N, int const K, string const& S) {
+    string L = S;
+    for (int i = 0; i < N; ++i) {
+        int j = i;
+        for (int k = i + 1; k < N; ++k) {
+            if (L[k] >= L[j]) continue;
+            string R = L;
+            swap(R[i], R[k]);
+            if (diff(S, R) <= K) {
+                j = k;
+            }
+        }
+        swap(L[i], L[j]);
+    }
+    return L;
+}
+
+int main() {
+    ios_base::sync_with_stdio(false);
+    cin.tie(0); cout.tie(0);
+
+    int N, K;
+    string S;
+    cin >> N >> K >> S;
+    cout << solve(N, K, S) << endl;
+
+    return 0;
+}