1846C - Rudolf and the Another Competition - CodeForces Solution

#include <bits/stdc++.h>
#include <vector>
#define pb push_back
#define yes cout << "YES" << endl;
#define no cout << "NO" << endl;
#define ll  long long int 
#define gt greater<ll>()
#define ff first
#define ss second
#define pi acos(-1)
#define ull unsigned long long
#define pb push_back
#define all(x) x.begin(), x.end()
#define  mod 1000000007;
#define bi_one(n)      __builtin_popcount(n)
#define str(a)          a.begin(),a.end()
#define mem(a,b)        memset(a, b, sizeof(a) )
#define max_ele(a,n)    *max_element(a,a+n)
#define min_ele(a,n)    *min_element(a,a+n)
#define fio()                     \
    ios_base::sync_with_stdio(0); \
    cin.tie(0);                   \
    cout.tie(0);
#define sp(n) fixed << setprecision(n)
#define Erase(s) s.erase(unique(s.begin(), s.end()), s.end())
#define fn0 for (i = 0; i < n; i++)
#define fn1 for(i=1; i<=n; i++)
#define upper(v,val) upper_bound(v.begin(), v.end(), val)-v.begin()
#define lower(v,val) lower_bound(v.begin(), v.end(), val)-v.begin()
#define min3(a, b, c) min(a, min(b, c))
#define max3(a, b, c) max(a, max(b, c))
using namespace std;
const int N=2e5+5;
vector<int> g[N];
bool vis[N];
int n,m,ans=0;
vector<ll>v;
map<ll,ll>mp;
void print(vector<ll> &v)
{
    for (ll i = 0; i < v.size(); i++)
    {
        cout << v[i] << " ";
    }
    cout << endl;
}

void solution()
{
    ll n, m,sq, l = 0,r=0, k = 0, i, j, a=0, b=0, c = 0, d = 0, d1 = 0, sum = 0;
    string s,s1="";
    cin>>n>>m>>k;
    vector<vector<ll>>v;
    fn0
    {
        vector<ll>vv;
        for(j=0; j<m; j++)
        {
            cin>>a;
            vv.pb(a);
        }
        sort(all(vv));
        vector<ll>pp;
        sum=0;
        for(j=0; j<m; j++)
        {
            sum+=vv[j];
            pp.pb(sum);
        }
        v.pb(pp);
    }
    
    vector<pair<ll,ll>> dd;
    for(i=0; i<v.size(); i++)
    {
        c=0;
        sum=0;
        for(j=0; j<v[i].size(); j++)
        {
            if(v[i][j]<=k)
            {
                c++;
                sum+=v[i][j];
            }
            else
                break;

        }
        //cout<<c<< " "<<sum<<endl;
        dd.pb({c,sum});
    }

    d=dd[0].ff;
    d1=dd[0].ss;
    c=1;
    for(i=1; i<dd.size(); i++)
    {
        if(dd[i].ff>d)
            c++;
        else if(dd[i].ff==d)
        {
            if(dd[i].ss<d1)
                c++;
        }
    }
    cout<<c<<endl;
}

int main()
{
    fio();
    int tt = 1;
    cin >> tt;
   // int x=1;
    while (tt--)
    {
        //cout<<"Case "<<x<< ": ";
        solution();
        //x++;
    }
}