Submission #74020981

Source Code Expand

#include <bits/stdc++.h>
#define fastio cin.tie(0)->sync_with_stdio(0)
using namespace std;
using ll = long long;
using pii = pair<ll,ll>;
using db = long double;

int main(){
	fastio;
	int n,m;cin >> n >> m;
	vector<ll> arr(n);
	for (int i=0;i<n;i++){
		ll c;cin >> c;
		ll a;cin >> a;
		ll sum = 0;
		while (a--){
			ll b;cin >> b;
			sum += b;
		}arr[i]=sum-c;
	}
	sort(arr.begin(),arr.end(),greater<ll>());
	ll cur=0;
	for (int i=0;i<m;i++){
		if (arr[i]>0) cur += arr[i];
	}cout << max((ll)0,cur);
	return 0;
}

Submission Info

Submission Time
Task C - Bargain Shopping Mall Tour
User Axteln
Language C++23 (GCC 15.2.0)
Score 333
Code Size 543 Byte
Status AC
Exec Time 18 ms
Memory 4288 KiB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 333 / 333
Status
AC × 3
AC × 62
Set Name Test Cases
Sample sample01.txt, sample02.txt, sample03.txt
All sample01.txt, sample02.txt, sample03.txt, in01.txt, in02.txt, in03.txt, in04.txt, in05.txt, in06.txt, in07.txt, in08.txt, in09.txt, in10.txt, in11.txt, in12.txt, in13.txt, in14.txt, in15.txt, in16.txt, in17.txt, in18.txt, in19.txt, in20.txt, in21.txt, in22.txt, in23.txt, in24.txt, in25.txt, in26.txt, in27.txt, in28.txt, in29.txt, in30.txt, in31.txt, in32.txt, in33.txt, in34.txt, in35.txt, in36.txt, in37.txt, in38.txt, in39.txt, in40.txt, in41.txt, in42.txt, in43.txt, in44.txt, in45.txt, in46.txt, in47.txt, in48.txt, in49.txt, in50.txt, in51.txt, in52.txt, in53.txt, in54.txt, in55.txt, in56.txt, in57.txt, in58.txt, in59.txt
Case Name Status Exec Time Memory
in01.txt AC 1 ms 3540 KiB
in02.txt AC 1 ms 3572 KiB
in03.txt AC 1 ms 3620 KiB
in04.txt AC 1 ms 3652 KiB
in05.txt AC 1 ms 3592 KiB
in06.txt AC 1 ms 3652 KiB
in07.txt AC 1 ms 3728 KiB
in08.txt AC 1 ms 3592 KiB
in09.txt AC 1 ms 3696 KiB
in10.txt AC 18 ms 4120 KiB
in11.txt AC 18 ms 4124 KiB
in12.txt AC 4 ms 3844 KiB
in13.txt AC 18 ms 4224 KiB
in14.txt AC 18 ms 4072 KiB
in15.txt AC 17 ms 4208 KiB
in16.txt AC 17 ms 4196 KiB
in17.txt AC 5 ms 3516 KiB
in18.txt AC 1 ms 3560 KiB
in19.txt AC 1 ms 3652 KiB
in20.txt AC 10 ms 4284 KiB
in21.txt AC 12 ms 4144 KiB
in22.txt AC 12 ms 4072 KiB
in23.txt AC 11 ms 4196 KiB
in24.txt AC 11 ms 4288 KiB
in25.txt AC 5 ms 3644 KiB
in26.txt AC 10 ms 4288 KiB
in27.txt AC 1 ms 3480 KiB
in28.txt AC 1 ms 3696 KiB
in29.txt AC 1 ms 3600 KiB
in30.txt AC 1 ms 3428 KiB
in31.txt AC 1 ms 3540 KiB
in32.txt AC 1 ms 3668 KiB
in33.txt AC 1 ms 3540 KiB
in34.txt AC 1 ms 3696 KiB
in35.txt AC 1 ms 3584 KiB
in36.txt AC 1 ms 3716 KiB
in37.txt AC 1 ms 3652 KiB
in38.txt AC 1 ms 3560 KiB
in39.txt AC 16 ms 4072 KiB
in40.txt AC 18 ms 4196 KiB
in41.txt AC 5 ms 3516 KiB
in42.txt AC 11 ms 3732 KiB
in43.txt AC 5 ms 3572 KiB
in44.txt AC 1 ms 3484 KiB
in45.txt AC 14 ms 3948 KiB
in46.txt AC 1 ms 3572 KiB
in47.txt AC 1 ms 3516 KiB
in48.txt AC 1 ms 3652 KiB
in49.txt AC 1 ms 3516 KiB
in50.txt AC 1 ms 3540 KiB
in51.txt AC 1 ms 3620 KiB
in52.txt AC 1 ms 3592 KiB
in53.txt AC 1 ms 3600 KiB
in54.txt AC 1 ms 3696 KiB
in55.txt AC 1 ms 3600 KiB
in56.txt AC 1 ms 3560 KiB
in57.txt AC 1 ms 3620 KiB
in58.txt AC 1 ms 3560 KiB
in59.txt AC 1 ms 3536 KiB
sample01.txt AC 1 ms 3592 KiB
sample02.txt AC 1 ms 3600 KiB
sample03.txt AC 1 ms 3592 KiB