View Code of Problem 49

#include<string.h>
#include<stdio.h>
struct node
{

    int a,b;

}s[11];
int main()
{
   int n,i,t;
   scanf("%d",&n);
   for(i=1;i<=n;i++)
   {

       scanf("%d",&s[i].b);
       s[i].a=i;
   }
  int max=s[1].b,min=s[1].b,pa=1,hu=1;
  for(i=1;i<=n;i++)
  {

      if(s[i].b>max) {max=s[i].b;pa=i;}
  }
  t=s[n].b;s[n].b=max;s[pa].b=t;
  for(i=1;i<=n;i++)
  {

      if(s[i].b<min) {min=s[i].b;hu=i;}


  }
   t=s[1].b;s[1].b=min;s[hu].b=t;
   for(i=1;i<=n;i++)
   {

       if(i==n)printf("%d\n",s[i].b);
       else printf("%d ",s[i].b);
   }
     return 0;

}

Double click to view unformatted code.


Back to problem 49