/ SeriousOJ /

Record Detail

Wrong Answer


  
# Status Time Cost Memory Cost
#1 Accepted 1ms 532.0 KiB
#2 Accepted 1ms 532.0 KiB
#3 Accepted 1ms 532.0 KiB
#4 Accepted 1ms 532.0 KiB
#5 Wrong Answer 20ms 532.0 KiB
#6 Wrong Answer 16ms 532.0 KiB

Code

#pragma GCC optimize("O3,unroll-loops")
#include<bits/stdc++.h>
using namespace std;

#define fastio() ios_base::sync_with_stdio(false);cin.tie(nullptr);
#define int long long

void del(multiset <int> &ms , int val) {
  ms.erase(ms.find(val)) ;
}

void solve() {
  
    int n ;
    cin >> n ;
    multiset <int> pos ;
    multiset <int> neg ;
    int s = 0 ;
    
    for(int i = 0 ; i < n ; i ++) {
      int x ;
      cin >> x ;
      if(x >= 0) pos.insert(x) ;
      else neg.insert(x) ;
    }
    
    if(!pos.empty()) {
      int val = *(--pos.end()) ;
      s = val ;
      del(pos , val) ;
    } else {
      int val = *(--neg.end()) ;
      s = val ;
      del(neg , val) ;
    }
    if(!pos.empty()) {
      int val = *(--pos.end()) ;
      s -= val ;
      del(pos , val) ;
    } else {
      int val = *(--neg.end()) ;
      s -= val ;
      del(neg , val) ;
    }

    if(!pos.empty()) {
      int val = *(--pos.end()) ;
      s += val ;
      del(pos , val) ;
    } 
    cout << s << endl ;
    
  
}
       
     
      









int32_t main() {

    fastio();
    int t = 1;
    cin >> t;
    while (t--) solve();
}

Information

Submit By
Type
Submission
Problem
P1208 C. Game on Integer
Contest
Educational Round 1
Language
C++17 (G++ 13.2.0)
Submit At
2025-07-14 17:50:35
Judged At
2025-07-14 17:50:35
Judged By
Score
5
Total Time
20ms
Peak Memory
532.0 KiB