1 solutions

  • 0
    @ 2025-11-5 16:22:02

    C :

    #include<stdio.h>
    
    int xuanze(int b[],int n){
    	int k,i,j,t;
    	for(i=0;i<n-1;i++){
    		k=i;
    		for(j=i;j<n;j++)
    		if(b[k]>b[j])
    		    k=j;
    		    if(k!=i){
    			
    			t=b[k];
    			b[k]=b[i];
    			b[i]=t;
    		
    		}
    		
    	}
    }
    int main(){
    	int i,a[10];
    	for(i=0;i<10;i++)
    	scanf("%d",&a[i]);
    	xuanze(a,10);
    	for(i=0;i<10;i++) 
    	printf("%d\n",a[i]);
    	return 0;
    } 
    

    C++ :

    #include <iostream>
    #include <algorithm>
    using namespace std;
    int a[15];
    int main()
    {
    	for (int i=0;i<10;i++)
    		cin>>a[i];
    	sort(a+0,a+10);
    	for (int i=0;i<10;i++)
    		cout <<a[i]<<endl;
    	return 0;
    } 
    
    • 1

    Information

    ID
    17727
    Time
    1000ms
    Memory
    128MiB
    Difficulty
    (None)
    Tags
    (None)
    # Submissions
    0
    Accepted
    0
    Uploaded By