#include #include # define int long long # define inf 987654321 using namespace std; int N,M,K; int L[100005]; //입력 배열 vector ans; int add[100005]; //제일 큰 원소랑 비교했을때 몇을 더해야 같아지는지 int prefix_add[100005]; //add에 대한 prefix_sum 배열 int cnt=0; void solve(int start,int end,int mk,int xe) //start~end 에서 봄 (나머지를 프리즈한다고 할 때) { //cout<=K) if(mk-sum<0) { //if (end-start+1==N) freeze the first element //else freeze the last element //cout<<"1st cmd : "; if(L[K+1]-L[start]>=M) { //cout<<"freeze first"; //freeze the first element ans.push_back(L[start]+M+xe); solve(start+1,end,mk-M,xe); } else if(L[K]-L[start]>=M && K==N) { //cout<<"freeze first"; //freeze the first element ans.push_back(L[start]+M+xe); solve(start+1,end,mk-M,xe); } else { //cout<<"freeze last"; //freeze the last element ans.push_back(L[end]+xe); solve(start,end-1,mk,xe); } } else { int x=(mk-sum)/(end-start+1); //cout<<"x : "<=M) { //freeze the first element //cout<<"3rd cmd : freeze first\n"; ans.push_back(L[start]+M+xe); solve(start+1,end,mk-M,xe); } else { //add every element x //cout<<"4th cmd : all\n"; int num_elements=end-start+1; solve(start,end,mk-x*num_elements,xe+x); } } } } signed main() { ios_base :: sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); cin>>N; for(int a=1;a<=N;a++) { cin>>L[a]; } cin>>M>>K; sort(L+1,L+N+1); for(int a=1;a<=N;a++) { add[a]=L[N]-L[a]; prefix_add[a]=prefix_add[a-1]+add[a]; } int value=M*K; int st_val=1; //처음 값들 고정시키기 for(int a=1;a<=K;a++) { int temp=L[a+1]-L[a]; if(temp>=M) { value-=M; st_val++; ans.push_back(M+L[a]); } else break; } solve(st_val,N,value,0); sort(ans.begin(),ans.end()); for(int a=0;a

제출 #49277

제출 정보

제출 결과

제출 코드

찾은 반례

입력:

오답 출력:

정답 출력: