/ SeriousOJ /

Record Detail

Wrong Answer


  
# Status Time Cost Memory Cost
#1 Wrong Answer 1ms 540.0 KiB
#2 Wrong Answer 1ms 540.0 KiB
#3 Wrong Answer 17ms 568.0 KiB
#4 Wrong Answer 18ms 576.0 KiB
#5 Wrong Answer 12ms 796.0 KiB
#6 Wrong Answer 34ms 1.566 MiB
#7 Wrong Answer 35ms 1.66 MiB
#8 Wrong Answer 36ms 1.582 MiB
#9 Wrong Answer 35ms 1.66 MiB
#10 Wrong Answer 35ms 1.664 MiB
#11 Wrong Answer 33ms 1.668 MiB
#12 Wrong Answer 32ms 1.625 MiB
#13 Wrong Answer 11ms 580.0 KiB
#14 Wrong Answer 13ms 540.0 KiB

Code

#include<bits/stdc++.h>
using namespace std;
const long long M=1e7+1,MOD=1000000007;
typedef long long ll;
#define double long double
#define debug(x) cout<<x<<endl

int main()
{
    ios::sync_with_stdio(false);
    cin.tie(0);
    int t;
    cin>>t;
    while(t--)
    {
       int n;
       cin>>n;
       vector<int>v;
       for(int i=1;i<=n*n;i++){
        int a;
        cin>>a;
        v.push_back(a);
       }
       sort(v.begin(),v.end());
       cout<<v[0]+v[n-2]<<"\n";
    }


    return 0;
 
}

Information

Submit By
Type
Submission
Problem
P1065 Matrix Sum
Language
C++20 (G++ 13.2.0)
Submit At
2024-05-30 17:54:03
Judged At
2024-05-30 17:54:03
Judged By
Score
0
Total Time
36ms
Peak Memory
1.668 MiB