feat(codeforces): implement solution for p2189A

Author: lzwjava

src/main/java/com/lzw/solutions/codeforces/p2189A/Main.java

@@ -10,11 +10,32 @@ public class Main {
     private static final PrintWriter out = new PrintWriter(System.out, true);
 
     private static void solve() throws IOException {
-        // your code here
+        String[] first = in.readLine().split(" ");
+        int n = Integer.parseInt(first[0]);
+        int h = Integer.parseInt(first[1]);
+        int l = Integer.parseInt(first[2]);
+
+        String[] line = in.readLine().split(" ");
+        int cntRow = 0;
+        int cntCol = 0;
+
+        for (String s : line) {
+            int x = Integer.parseInt(s);
+            if (x <= h) cntRow++;
+            if (x <= l) cntCol++;
+        }
+
+        int maxPairs = Math.min(cntRow, cntCol);
+        maxPairs = Math.min(maxPairs, n / 2);
+
+        out.println(maxPairs);
     }
 
     public static void main(String[] args) throws IOException {
-        solve();
+        int t = Integer.parseInt(in.readLine());
+        while (t-- > 0) {
+            solve();
+        }
         out.close();
     }
-}
+}

src/main/resources/codeforces/p2189A/1.in

@@ -0,0 +1,15 @@
+7
+2 1 1
+1 1
+5 2 2
+1 2 2 3 2
+8 4 2
+7 2 2 2 3 4 4 2
+7 3 6
+10 4 1 3 5 4 6
+2 4 4
+5 5
+7 6 3
+10 4 1 3 5 4 6
+4 1 1
+1 1 1 1