when the ratings update cannot wait for more time??

hey anyone who can find whats wring in my code of problem B

include<bits/stdc++.h>

using namespace std;

define ll long long int

define el "\n"

define mod 1000000000

int main() { ll t; cin>>t; while(t--){ ll n,m; cin>>n>>m; ll a[n][m]; ll b[n][m]; ll temp=0; vector<pair<ll,ll> > v(m);

for(ll i=0;i<n;i++){
    for(ll j=0;j<m;j++){
        cin>>a[i][j];
        b[i][j]=a[i][j];
    }
  }
  //v[0].first=3;

while(temp!=m){
        ll c=mod;
   for(ll i=0;i<n;i++){
    for(ll j=0;j<m;j++){

        if(a[i][j]<=c){

            c=a[i][j];

           v[temp].first=i;

        v[temp].second=j;
        }

    }
  }
  a[v[temp].first][v[temp].second]=mod;

temp++; }

for(ll j=0;j<m;j++){
   swap(b[v[j].first][v[j].second],b[v[j].first][j]);

}

// cout<<el; for(ll i=0;i<n;i++){ for(ll j=0;j<m;j++){ cout<<b[i][j]<<" "; } cout<<el;}

} return 0; }

and is the value of sum is same for all different possibilites??

one more doubt in editorial mention for each bit, we need to turn it off (make it 0) in at least one of the elements. Means we make that element equal to 0 ??

means in problem b 3rd condition:- the sum of its elements is as large as possible.

This sum is equal to all cases of array of size n that we make ??

I have a doubt in problem B In problem B the sum of all elements in array is maximum but the value of maximum should be same or not for every size of array =n that we make for this conditions:- all its elements are integers between 0 and 2k−1 (inclusive); the bitwise AND of all its elements is 0; the sum of its elements is as large as possible

I have a doubt in problem B In problem B the sum of all elements in array is maximum but the value of maximum should be same or not for every size of array =n that we make for this conditions:- all its elements are integers between 0 and 2k−1 (inclusive); the bitwise AND of all its elements is 0; the sum of its elements is as large as possible.

hey anyone who solve problem B in problem B can we take same element more than one times??