| Run ID | Author | Problem | Lang | Verdict | Score | Time | Memory | Code Length | Submit Time |
|---|---|---|---|---|---|---|---|---|---|
| 110956 | 梁乃元 | K 次取反后最大化的数组和 | C++ | Wrong Answer | 33 | 0 MS | 264 KB | 449 | 2023-11-18 08:20:39 |
# include <bits/stdc++.h> using namespace std ; int nums [114514] ; int main ( ) { int n , k ; cin >> n >> k ; for ( int i = 1 ; i <= n ; i ++ ) { cin >> nums [i] ; } sort ( nums + 1 , nums + n + 1 ) ; for ( int i = 1 ; i <= k ; i ++ ) { nums [i] *= -1 ; sort ( nums + 1 , nums + n + 1 ) ; } long long sum = 0 ; for ( int i = 1 ; i <= n ; i ++ ) { sum += nums [i] ; } cout << sum << endl ; return 0 ; }