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;
   }
   for(i=1;i<=n;i++)
   {
       if(s[i].b<=s[1].b) {
            t=s[1].b;s[1].b=s[i].b;s[i].b=t;}
   }
    for(i=1;i<=n;i++)
   {
       if(s[i].b>=s[n].b) {
            t=s[n].b;s[n].b=s[i].b;s[i].b=t;}
   }
   for(i=1;i<=n;i++)
   {
       if(i==n) printf("%d\n",s[n].b);
       else printf("%d ",s[i].b);
   }
     return 0;

}

Double click to view unformatted code.


Back to problem 49