Advertisement
Guest User

Untitled

a guest
Feb 20th, 2020
81
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
text 0.89 KB | None | 0 0
  1. #include<stdio.h>
  2.  
  3. int main(){
  4.  
  5. long long int M,N;
  6. int i,j;
  7. long long int rez,pocetak;
  8. long long int max=0;
  9. int S[100000],uzeli[100000]={0};
  10.  
  11. scanf("%lli ",&M);
  12. scanf("%lli\n",&N);
  13.  
  14.  
  15.  
  16.  
  17. for(i=0;i<N;i++){
  18. scanf("%d ",&S[i]);
  19. }
  20.  
  21. for(i=0;i<N;i++){
  22. for(j=0;j<N;j++){
  23.  
  24. if(i!=j){
  25.  
  26. rez=S[i]+S[j];
  27. if(rez>max && max<=M){
  28.  
  29. max=rez;
  30. if(j==0){
  31. uzeli[j]=1;
  32.  
  33. }
  34. else{
  35. uzeli[j-1]=0;
  36. uzeli[j]=1;
  37. }
  38. if(i==0){
  39. uzeli[i]=1;
  40. }
  41. else{
  42. uzeli[i-1]=0;
  43. uzeli[i]=1;
  44. }
  45.  
  46. }
  47.  
  48. }
  49.  
  50.  
  51. }
  52.  
  53.  
  54. }
  55.  
  56.  
  57. for(i=0;i<N;i++){
  58. rez=max+S[i];
  59. if(rez>max && rez<=M && uzeli[i]==0){
  60. max=rez;
  61. uzeli[i]=1;
  62.  
  63.  
  64. }
  65. }
  66.  
  67. printf("%lli\n",max);
  68. for (i = 0; i < N; ++i)
  69. {
  70. if(uzeli[i]){
  71. printf("%lli ",i);
  72. }
  73. }
  74.  
  75. return 0;
  76. }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement