3 solutions

  • 2
    @ 2024-12-29 14:36:57
    #include<bits/stdc++.h>
    using namespace std;
    const int N=25,M=1010;
    int a[N];
    int cnt[M];
    int main()
    {
    	int n;
    	cin>>n;
    	for(int i=1;i<=n;i++)
    	{
    		int x;
    		cin>>x;
    		cnt[x]++;
    	}
    	int i=1;
    	for(int j=0;j<M;j++)
    	{
    		while(cnt[j]>0)
    		{
    			a[i++]=j;
    			cnt[j]--;
    		}
    	}
    	for(int i=1;i<=n;i++)
    	{
    		cout<<a[i]<<" ";
    	}
    	return 0;
    }
    • 1
      @ 2025-1-23 11:34:50
      #include<bits/stdc++.h>
      using namespace std;
      int a[1145];
      int main()
      {
      	int n;
      	cin>>n;
      	for(int i=1;i<=n;i++) cin>>a[i];
      	for(int i=1;i<=n;i++){
      		for(int j=1;j+1<=n-i+1;j++){
      			if(a[j]>a[j+1]) swap(a[j],a[j+1]);
      		}
      	}
      	for(int i=1;i<=n;i++) cout<<a[i]<<" ";
      	return 0;
      }
      
      • 1
        @ 2024-8-22 14:15:50
        #include<bits/stdc++.h>
        using namespace std;
        const int N=25,M=1010;
        int a[N];
        int cnt[M];
        int main()
        {
        	int n;
        	cin>>n;
        	for(int i=1;i<=n;i++)
        	{
        		int x;
        		cin>>x;
        		cnt[x]++;
        	}
        	int i=1;
        	for(int j=0;j<M;j++)
        	{
        		while(cnt[j]>0)
        		{
        			a[i++]=j;
        			cnt[j]--;
        		}
        	}
        	for(int i=1;i<=n;i++)
        	{
        		cout<<a[i]<<" ";
        	}
        	return 0;
        }
        
        • @ 2024-8-22 14:16:42

          除了我谁发评论傻逼

        • @ 2026-1-18 11:41:18

          @ 除了我谁发评论傻逼!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!

      • 1

      Information

      ID
      115
      Time
      1000ms
      Memory
      256MiB
      Difficulty
      1
      Tags
      (None)
      # Submissions
      65
      Accepted
      29
      Uploaded By