hdu 2016 数据的交换输出

#include <algorithm>
#include <iostream>
#include <cstring>
#include <cstdio>
#include <vector>
#include <cmath>
#include <queue>
#include <deque>
#include <cmath>
#include <map>

using namespace std;
typedef long long ll;

const double inf=1e20;
const int maxn=2e5+10;
const int mod=1e9+7;

int a[maxn];

int main(){
    int n;
    while(scanf("%d",&n)!=EOF){
        if(n==0)break;
        int j=0;
        for(int i=0;i<n;i++){
            scanf("%d",&a[i]);
            if(a[j]>a[i])j=i;
        }
        swap(a[0],a[j]);
        for(int i=0;i<n;i++){
            if(i==0)printf("%d",a[i]);
            else printf(" %d",a[i]);
        }
        printf("\n");
    }
    return 0;
}