提出 第二回

src/apple.c

@@ -1,17 +1,32 @@
-#include <stdio.h>
-
-int n;
-int k;
-int A[100000];
-
-
-int main(){
-  int i, lb, ub;
-  scanf("%d%d", &n, &k);
-  for(i = 0; i < n; i++){
-    scanf("%d", &A[i]);
-  }
-
-
-  return 0;
-}
+#include <stdio.h>
+int n;
+int k;
+int A[100000];
+
+
+int p(int x) {
+    int s = 0;
+    for (int i = 0; i < n; i++) {
+        s += (A[i] + x - 1) / x;
+    }
+    if (s <= k) return 1;
+    else return 0;
+}
+
+int main() {
+    int i, lb, ub;
+    scanf("%d%d", &n, &k);
+    for (i = 0; i < n; i++) {
+        scanf("%d", &A[i]);
+    }
+
+    lb = 0;
+    ub = 1000000000;
+    while (ub - lb > 1) {
+        int mid = (ub + lb) / 2;
+        if (p(mid)) ub = mid;
+        else lb = mid;
+    }
+    printf("%d\n", ub);
+    return 0;
+}

src/array.c

@@ -1,18 +1,27 @@
-#include <stdio.h>
-
-int n;
-int k;
-int A[100000];
-
-
-int main(){
-  int i, lb, ub;
-  scanf("%d%d", &n, &k);
-  for(i = 0; i < n; i++){
-    scanf("%d", &A[i]);
-  }
-
-
-
-  return 0;
-}
+#include <stdio.h>
+
+int n;
+int k;
+int A[100000];
+
+
+int main() {
+    int lb, ub;
+    scanf("%d%d", &n, &k);
+    for (int i = 0; i < n; i++) {
+        scanf("%d", &A[i]);
+    }
+
+    lb = -1; ub = n;
+    while (ub - lb > 1) {
+        int mid = (lb + ub) / 2;
+        if (A[mid] >= k) {
+            ub = mid;
+        }
+        else {
+            lb = mid;
+        }
+    }
+    printf("%d\n", ub);
+    return 0;
+}

src/spear.c

@@ -1,17 +1,32 @@
-#include <stdio.h>
-
-int n;
-int k;
-int A[100000];
-
-
-int main(){
-  int i, lb, ub;
-  scanf("%d%d", &n, &k);
-  for(i = 0; i < n; i++){
-    scanf("%d", &A[i]);
-  }
-
-
-  return 0;
-}
+#include <stdio.h>
+
+int n;
+int k;
+int A[100000];
+
+int p(int x) {
+    int s = 0;
+    if (x == 0) return 1;
+    for (int i = 0; i < n; i++) {
+        s += A[i] / x;
+    }
+    if (s >= k) return 1;
+    else return 0;
+}
+
+
+int main() {
+    int i, lb, ub;
+    scanf("%d%d", &n, &k);
+    for (i = 0; i < n; i++) {
+        scanf("%d", &A[i]);
+    }
+    lb = 0; ub = 1000000001;
+    while (ub - lb > 1) {
+        int mid = (lb + ub) / 2;
+        if (p(mid) == 0) ub = mid;
+        else lb = mid;
+    }
+    printf("%d\n", lb);
+    return 0;
+}

src/works.c

@@ -4,6 +4,18 @@ int n;
 int k;
 int A[100000];
 
+int p(int x) {
+    int s = 0, cnt = 0;
+    for (int i = 0; i < n; i++) {
+        if (A[i] > x) return 0;
+        if (s + A[i] > x) {
+            s = A[i];
+            cnt++;
+        }
+        else s += A[i];
+    }
+    return (cnt < k);
+}
 
 int main(){
   int i, lb, ub;
@@ -12,6 +24,13 @@ int main(){
     scanf("%d", &A[i]);
   }
 
+  lb = 0; ub = 1000000000;
 
+  while (ub - lb > 1) {
+      int mid = (lb + ub) / 2;
+      if (p(mid)) ub = mid;
+      else lb = mid;
+  }
+  printf("%d\n", ub);
   return 0;
 }