提出

src/array.c

@@ -11,8 +11,17 @@ int main(){
   for(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

@@ -4,14 +4,32 @@ int n;
 int k;
 int A[100000];
 
+int p(int x){
+  int i,sum;
+  sum=0;
+  for (i=0;i<n;i++){
+    sum +=A[i]/x;
+  }
+  return sum >= k;
+}
 
 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 =(lb +ub/2);
+    if(p(mid)){
+      ub=mid;
+    }
+    else {
+      lb=mid;
+    }
+  }
+  printf("%d\n", ub);
   return 0;
-}
+}

src/works.c

@@ -4,14 +4,41 @@ int n;
 int k;
 int A[100000];
 
+int p(int x){
+  int i,j,sum;
+  sum=0;
+  j=1;
+  for(i=0;i<n;i++){
+    if(A[i]>x)return 0;
+    if(j+A[i]<=x){
+      j+=A[i];
+    }
+    else{
+      j++;
+      sum=A[i];
+    }
+  }
+  return j<=k;
+}
+
 
 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 =(lb +ub/2);
+    if(p(mid)){
+      ub=mid;
+    }
+    else {
+      lb=mid;
+    }
+  }
+  printf("%d\n", ub);
   return 0;
 }