정답 코드
#include <iostream>
#include <algorithm>
#include <limits.h>
using namespace std;
int k, n;
long long lines[10001];
int ans;
long long cntLines(long long d) {
long long ret=0;
for(int i=0; i<k; i++) {
ret += lines[i]/d;
}
return ret>=n;
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
cin>>k>>n;
for(int i=0; i<k; i++) {
cin>>lines[i];
}
//binary search
long long L=0, R=INT_MAX;
while(L<=R) {
long long mid = (L+R)/2;
if(cntLines(mid)) { //make answer longer
ans=mid;
L = mid+1;
}
else { //make shorter
R = mid-1;
}
}
cout<<ans<<'\n';
return 0;
}
int 와 long long 범위를 잘 고려하자.