/ SeriousOJ /

Record Detail

Accepted


  
# Status Time Cost Memory Cost
#1 Accepted 3ms 532.0 KiB
#2 Accepted 2ms 532.0 KiB
#3 Accepted 2ms 384.0 KiB
#4 Accepted 3ms 536.0 KiB
#5 Accepted 24ms 588.0 KiB
#6 Accepted 11ms 532.0 KiB
#7 Accepted 48ms 1.938 MiB
#8 Accepted 39ms 2.074 MiB
#9 Accepted 42ms 2.078 MiB
#10 Accepted 37ms 2.074 MiB
#11 Accepted 27ms 532.0 KiB
#12 Accepted 46ms 580.0 KiB
#13 Accepted 20ms 2.02 MiB
#14 Accepted 44ms 2.066 MiB
#15 Accepted 28ms 572.0 KiB
#16 Accepted 56ms 572.0 KiB
#17 Accepted 41ms 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 ;
    vector <int> a(n) ;
    for(int i = 0 ; i < n ; i ++) cin >> a[i] ;
    sort(a.begin() , a.end()) ;
    reverse(a.begin() , a.end()) ;
    int ans = a[0] - a[1] ;
    int fans = ans ;
    for(int i = 2 ; i < n ; i ++) {
      if(a[i] <= 0) break ;
      if(i % 2 == 0) {
        ans += a[i] ;
      } else {
        ans -= a[i] ;
      }
    }
    cout << ans << endl ;
  
}
       
     
      









int32_t main() {

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

Information

Submit By
Type
Submission
Problem
P1208 C. Game on Integer
Language
C++17 (G++ 13.2.0)
Submit At
2025-07-14 18:13:12
Judged At
2025-07-14 18:13:12
Judged By
Score
100
Total Time
56ms
Peak Memory
2.078 MiB