2 solutions

  • 1
    @ 2026-7-23 11:53:43
    #include<bits/stdc++.h>
    using namespace std;
    const int N=10010;
    int a[N];
    int main()
    {
    	int n;
    	cin>>n;
    	for(int i=1;i<=n;i++)
    	{
    		cin>>a[i];
    	}
    	int cnt=0;
    	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]);
    				cnt++;
    			}
    		}
    	}
    	cout<<cnt;
    	return 0;
    }
    • 0
      @ 2025-3-29 14:00:48
      #include<bits/stdc++.h>
      using namespace std;
      const int N=10010;
      int a[N];
      int main()
      {
      	int n;
      	cin>>n;
      	for(int i=1;i<=n;i++)
      	{
      		cin>>a[i];
      	}
      	int cnt=0;
      	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]);
      				cnt++;
      			}
      		}
      	}
      	cout<<cnt;
      	return 0;
      }
      • 1

      Information

      ID
      942
      Time
      1000ms
      Memory
      256MiB
      Difficulty
      1
      Tags
      (None)
      # Submissions
      85
      Accepted
      39
      Uploaded By