题目1053：互换最大最小数

#include <iostream> #include <stdio.h> #include <algorithm> #include <math.h> #include <string> #include <string.h> #include <vector> using namespace std; //1051   int idxmin,idxmax; int N[21]; int main(){     int n;     while(scanf("%d",&n)!=EOF){         int minn=1e5+10,maxn=-1;         for(int i=0;i<n;i++) scanf("%d",N+i);         for(int i=0;i<n;i++){             if(N[i]>maxn) maxn=N[i],idxmax=i;             if(N[i]<minn) minn=N[i],idxmin=i;         }         swap(N[idxmax],N[idxmin]);         for(int i=0;i<n;i++){             if(i!=n-1)  printf("%d ",N[i]);             else        printf("%d\n",N[i]);         }     }     return 0; } /**************************************************************     Problem: 1053     User: cust123     Language: C++     Result: Accepted     Time:0 ms     Memory:1520 kb ****************************************************************/