GH-13: Solve problem codejam2022d1000000

.gitignore

@@ -5,4 +5,5 @@ bazel-genfiles
 bazel-out
 bazel-testlogs
 bazel-*
-*.md2
+*.md2
+test_data

collections/codejam-2022/README.md

@@ -14,6 +14,13 @@ Qualification Round
 </thead>
 <tbody>
 <tr>
+<td>d1000000</td>
+<td><a href="https://codingcompetitions.withgoogle.com/codejam/round/0000000000876ff1/0000000000a46471">Link</a></td>
+<td>
+<a href="../../problems/codejam2022d1000000/src/main/solution.cpp"><code>cpp🐀</code></a>
+</td>
+</tr>
+<tr>
 <td>3D Printing</td>
 <td><a href="https://codingcompetitions.withgoogle.com/codejam/round/0000000000876ff1/0000000000a4672b">Link</a></td>
 <td>

problems/codejam2022d1000000/.gitignore

@@ -0,0 +1,7 @@
+solution
+output.txt
+/test_data/
+/tests
+test_data
+tests
+tests/

problems/codejam2022d1000000/README.md

@@ -0,0 +1,10 @@
+# AoC Problem 
+
+## Usage
+
+Run program with an example
+
+```
+bazel run src/main:solution < data/sample0.in
+bazel run src/main:solution < data/test_set_1/ts1_input.txt
+```

problems/codejam2022d1000000/data/1.in

@@ -0,0 +1,9 @@
+4
+4
+6 10 12 8
+6
+5 4 5 4 4 4
+10
+10 10 7 6 7 4 4 5 7 4
+1
+10

problems/codejam2022d1000000/data/1.out

@@ -0,0 +1 @@
+10

problems/codejam2022d1000000/data/sample0.in

@@ -0,0 +1,9 @@
+4
+4
+6 10 12 8
+6
+5 4 5 4 4 4
+10
+10 10 7 6 7 4 4 5 7 4
+1
+10

problems/codejam2022d1000000/data/sample0.out

@@ -0,0 +1,4 @@
+Case #1: 4
+Case #2: 5
+Case #3: 9
+Case #4: 1

problems/codejam2022d1000000/sample_test_set_1/sample_ts1_input.txt

@@ -0,0 +1,9 @@
+4
+4
+6 10 12 8
+6
+5 4 5 4 4 4
+10
+10 10 7 6 7 4 4 5 7 4
+1
+10

problems/codejam2022d1000000/sample_test_set_1/sample_ts1_output.txt

@@ -0,0 +1,4 @@
+Case #1: 4
+Case #2: 5
+Case #3: 9
+Case #4: 1

problems/codejam2022d1000000/src/main/BUILD

@@ -0,0 +1,7 @@
+load("@rules_cc//cc:defs.bzl", "cc_binary")
+
+cc_binary(
+    name = "solution",
+    srcs = ["solution.cpp"],
+    visibility = ["//visibility:public"]
+)

problems/codejam2022d1000000/src/main/solution.cpp

@@ -0,0 +1,36 @@
+#include <algorithm>
+#include <cmath>
+#include <filesystem>
+#include <fstream>
+#include <iostream>
+#include <map>
+#include <set>
+#include <string>
+#include <vector>
+
+using namespace std;
+
+int main(int argc, char* argv[]) {
+  int tt;
+  int n;
+  cin >> tt;
+  int max_n;
+  for (int ti = 0; ti < tt; ti++) {
+    cin >> n;
+    int a[n];
+    for (int i = 0; i < n; i++) {
+      cin >> a[i];
+    }
+    sort(a, a + n);
+    int i = 0, j = 0;
+    while(i < n && j < n){
+      if(a[j] >= i+1){
+        i++;
+        j++;
+      } else {
+        j++;
+      }
+    }
+    cout << "Case #" << ti + 1 << ": " << i << endl;
+  }
+}