Run ID | Author | Problem | Lang | Verdict | Score | Time | Memory | Code Length | Submit Time |
---|---|---|---|---|---|---|---|---|---|
110953 | 吴亦洵 | K 次取反后最大化的数组和 | C++ | Wrong Answer | 66 | 0 MS | 248 KB | 267 | 2023-11-18 08:17:53 |
#include<bits/stdc++.h> using namespace std; int a[1005]; int main(){ int n,k,ans=0; cin>>n>>k; for(int i=1;i<=n;i++){ cin>>a[i]; } sort(a+1,a+1+n); for(int i=1;i<=n;i++){ if(i<=k){ a[i]*=-1; } ans+=a[i]; } cout<<ans; return 0; }