Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include<stdio.h>
- int main(){
- long long int M,N;
- int i,j;
- long long int rez,pocetak;
- long long int max=0;
- int S[100000],uzeli[100000]={0};
- scanf("%lli ",&M);
- scanf("%lli\n",&N);
- for(i=0;i<N;i++){
- scanf("%d ",&S[i]);
- }
- for(i=0;i<N;i++){
- for(j=0;j<N;j++){
- if(i!=j){
- rez=S[i]+S[j];
- if(rez>max && max<=M){
- max=rez;
- if(j==0){
- uzeli[j]=1;
- }
- else{
- uzeli[j-1]=0;
- uzeli[j]=1;
- }
- if(i==0){
- uzeli[i]=1;
- }
- else{
- uzeli[i-1]=0;
- uzeli[i]=1;
- }
- }
- }
- }
- }
- for(i=0;i<N;i++){
- rez=max+S[i];
- if(rez>max && rez<=M && uzeli[i]==0){
- max=rez;
- uzeli[i]=1;
- }
- }
- printf("%lli\n",max);
- for (i = 0; i < N; ++i)
- {
- if(uzeli[i]){
- printf("%lli ",i);
- }
- }
- return 0;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement