2 solutions

  • 5
    @ 2024-11-8 10:32:58
    #include<bits/stdc++.h>
    using namespace std;
    int a[1100];
    int main()
    {
    	int n;
    	cin>>n;
    	for(int i=1;i<=n;i++)
    	{
    		cin>>a[i]; 
    	}
    	int maxv=1; //最大值所在的位置
    	for(int i=1;i<=n;i++)
    	{
    		if(a[i]>a[maxv])
    		{
    			maxv=i;
    		}
    	}
    	int s=0;
    	for(int i=1;i<=n;i++)
    	{
    		if(a[i]!=a[maxv])
    		{
    			s+=a[i];
    		}
    	}
    	cout<<s;
    	return 0;
    }
    
    • -2
      @ 2024-11-16 22:22:58
      #include<bits/stdc++.h>
      using namespace std;
      int a[1111];
      int main()
      {
          int n;
          cin>>n;
          for(int i = 1;i <= n;i++)
          {
              cin>>a[i];
          }
          int max = 1;
          for(int i = 1;i <= n;i++)
          {
              if(a[i] > a[max])
              {
                  max = i;
              }
          }
          int q = 0;
          for(int i = 1;i <= n;i++)
          {
              if(a[i] != a[max])
              {
                  q += a[i];
              }
          }
          cout<<q;
          return 0;
      }
      
      
      • 1

      Information

      ID
      59
      Time
      1000ms
      Memory
      256MiB
      Difficulty
      1
      Tags
      (None)
      # Submissions
      127
      Accepted
      45
      Uploaded By