fork download
  1. #include<stdio.h>
  2.  
  3.  
  4. int main()
  5. {
  6. int n,m,i,max,min,num1,num2,temp;
  7. int large[100],small[100],index1=1,index2=1;
  8. /* READ N*/
  9. printf("Give N : \n");
  10. scanf("%d",&n);
  11. printf("N=%d\n",n);
  12.  
  13. /*Initialise MAX and MIN*/
  14. scanf("%d",&max);
  15. min=max;
  16. m=n-1;
  17. if(n%2==0){
  18. scanf("%d",&min);
  19. if(max<min) swap(max,min);
  20. m=m-1;}
  21.  
  22. /*Fill up arrays LARGE and SMALL*/
  23. for(i=1;i<=m/2;i++){
  24.  
  25. scanf("%d %d",&num1,&num2);
  26. if(num1>=num2)
  27. {
  28. large[index1++]=num1;
  29. small[index2++]=num2;
  30. }
  31. else
  32. {
  33. large[index1++]=num2;
  34. small[index2++]=num1;
  35. }
  36. }
  37. /*Now print the result*/
  38.  
  39. printf("\nMax=%d , MIN=%d\n",maxi(large,max,index1),mini(small,min,index2));
  40. return 0;
  41. }
  42.  
  43.  
  44. int swap(i,j)
  45. int *i,*j;
  46. {
  47. int temp;
  48. temp=*i;
  49. *i=*j;
  50. *j=temp;
  51. }
  52.  
  53. int maxi(arr,max,index)
  54. int arr[],max,index;
  55. {
  56. int i;
  57. for(i=1;i<index;i++)
  58. if(max<arr[i]) max=arr[i];
  59. return (maxi);
  60. }
  61.  
  62. int mini(arr,min,index)
  63. int arr[],min,index;
  64. {
  65. int i;
  66. for(i=1;i<index;i++)
  67. if(min>arr[i]) min=arr[i];
  68. return (mini);
  69. }
  70.  
  71.  
  72.  
Time limit exceeded #stdin #stdout 5s 2252KB
stdin
Standard input is empty
stdout
Standard output is empty