提出 #76712039

---

ソースコード 拡げる

#include <bits/stdc++.h>

// clang-format off
#define all(x)             x.begin() , x.end()
#define ll                 long long
#define li                 long int
#define mod                1000000007
#define endl               "\n"
#define pt_vec1(x)         for(auto it : x) {cout<<it<<" ";} cout<<endl;
#define pt_vec2(x)         for(auto it : x){for(auto y : it){cout << y << " ";}cout << endl;}
#define ip_vec(x)          for(auto &it : x) cin>>it;
#define fast_io            ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);

using namespace std;
// clang-format on

int xx[4] = {-1, 0, 1, 0};
int yy[4] = {0, -1, 0, 1};

/*
   -> Check Constraints
   -> Clear Global variables
*/

void test_case() {

    ll n , k ; cin >> n >> k ; 

    vector<vector<ll>> arr; 
    vector<int> len ; 
    for(int i = 0 ; i < n ; i++){
        ll c ; cin >> c ; vector<ll> arr1(c) ; ip_vec(arr1);
        sort(all(arr1));
        arr.push_back(arr1);
        len.push_back(c/2);
    }

    vector<ll> median ; 
    for(int i = 0 ; i < n ; i++){
        median.push_back(arr[i][len[i]]);
    }

    ll ans = 0 ;
    sort(median.rbegin() , median.rend()) ;
    for(int i = 0 ; i <k ;i++) {
        if(median[i] < 0) break;
        ans += median[i];
    }
    cout << ans << endl;

}

int main() {
    fast_io

// #ifndef ONLINE_JUDGE
//     freopen("input.txt", "r", stdin);
//     freopen("output.txt", "w", stdout);
// #endif

    ll t =1;
    while (t--) {
        test_case();
    }
    return 0;
}

提出情報

ジャッジ結果