Merge pull request #412 from xirc/atcoder/abc091

AtCoder/ABC091

Author: xirc

atcoder/abc091/A/main.cpp

@@ -0,0 +1,17 @@
+#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 A, B, C;
+    cin >> A >> B >> C;
+    auto ans = (A + B >= C) ? "Yes" : "No";
+    cout << ans << endl;
+
+    return 0;
+}

atcoder/abc091/B/main.cpp

@@ -0,0 +1,34 @@
+#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, M;
+    string s;
+
+    map<string,int> netp;
+
+    cin >> N;
+    for (int i = 0; i < N; ++i) {
+        cin >> s;
+        netp[s]++;
+    }
+    cin >> M;
+    for (int i = 0; i < M; ++i) {
+        cin >> s;
+        netp[s]--;
+    }
+
+    int maxp = 0;
+    for (auto const& e : netp) {
+        maxp = max(maxp, e.second);
+    }
+    cout << maxp << endl;
+
+    return 0;
+}

atcoder/abc091/C/main.cpp

@@ -0,0 +1,50 @@
+#include <bits/stdc++.h>
+
+using namespace std;
+using ll = int64_t;
+using ff = long double;
+
+int N;
+vector<pair<int,int>> rs, bs;
+
+int solve() {
+    // x asc, y asc
+    sort(bs.begin(), bs.end());
+    // y desc x desc
+    sort(rs.begin(), rs.end(), [](auto const& lhs, auto const& rhs) {
+        if (lhs.second != rhs.second) return lhs.second > rhs.second;
+        return lhs.first > rhs.first;
+    });
+
+    int count = 0;
+    vector<bool> used(N, false);
+    for (int i = 0; i < N; ++i) {
+        for (int j = 0; j < N; ++j) {
+            if (used[j]) continue;
+            if (bs[i].first <= rs[j].first) continue;
+            if (bs[i].second <= rs[j].second) continue;
+            used[j] = true;
+            ++count;
+            break;
+        }
+    }
+    return count;
+}
+
+int main() {
+    ios_base::sync_with_stdio(false);
+    cin.tie(0); cout.tie(0);
+
+    cin >> N;
+    rs.assign(N, { 0, 0 });
+    bs.assign(N, { 0, 0 });
+    for (int i = 0; i < N; ++i) {
+        cin >> rs[i].first >> rs[i].second;
+    }
+    for (int i = 0; i < N; ++i) {
+        cin >> bs[i].first >> bs[i].second;
+    }
+    cout << solve() << endl;
+
+    return 0;
+}