/ SeriousOJ /

Record Detail

Wrong Answer


  
# Status Time Cost Memory Cost
#1 Wrong Answer 1ms 448.0 KiB
#2 Wrong Answer 1ms 324.0 KiB
#3 Wrong Answer 1ms 320.0 KiB
#4 Wrong Answer 2ms 532.0 KiB
#5 Wrong Answer 81ms 320.0 KiB
#6 Accepted 91ms 2.047 MiB
#7 Wrong Answer 91ms 2.047 MiB
#8 Wrong Answer 92ms 2.047 MiB
#9 Accepted 83ms 2.047 MiB
#10 Accepted 84ms 2.047 MiB
#11 Wrong Answer 85ms 2.043 MiB
#12 Wrong Answer 86ms 2.051 MiB
#13 Wrong Answer 86ms 2.047 MiB
#14 Wrong Answer 86ms 2.051 MiB
#15 Wrong Answer 86ms 2.043 MiB
#16 Wrong Answer 85ms 2.051 MiB

Code

#include <iostream>
using namespace std;
int main()
{
    int t;
    cin>>t;
    for(int j=0;j<t;j++)
    {
    int N;
	cin>>N;
	int A[N],B[N],C[N],D[N];
	for(int i=1;i<=N;i++)
	{
		cin>>A[i];
	}
	for(int i=1;i<=N;i++)
	{
		cin>>B[i];
	}
	for(int i=1;i<=N;i++)
	{
		cin>>C[i];
	}
	for(int i=1;i<=N;i++)
	{
		if(A[i]>B[i]&&A[i]>C[i])
		{ D[i]=A[i];}
		else if (B[i]>A[i]&&B[i]>C[i])
		{ D[i]=B[i];}
		else{D[i]=C[i];}
	}
	int sum=0;
	for(int i=1;i<=N;i++)
	{
		sum =sum+D[i];
	}
	cout<<sum<<endl;
    }
}

Information

Submit By
Type
Submission
Problem
P1046 Maximum sum in 3-array
Contest
TLE_Headquarters - round #1
Language
C++20 (G++ 13.2.0)
Submit At
2024-03-27 18:18:00
Judged At
2024-10-03 13:55:12
Judged By
Score
15
Total Time
92ms
Peak Memory
2.051 MiB