12018 yonsei toto

#include <stdio.h>
#include <algorithm>
using namespace std;
int arr[105] = { 0 };
bool desc(int a, int b) {
	return a > b;
}
int main() {
	int t, point, idx = 0;
	scanf("%d %d", &t, &point);
	while (t--) {
		int all, can;
		scanf("%d %d", &all, &can);
		int temp[105] = { 0 };
		for (int i = 0; i < all; i++) {
			scanf("%d", &temp[i]);
		}
		if (all < can) {
			arr[idx++] = 1;
			
			continue;
		}
		sort(temp, temp + all, desc);
		arr[idx++] = temp[can - 1];
	}
	sort(arr, arr + idx);
	int total = 0,ans=0;
	for (int i = 0; i < idx; i++) {
		if (total + arr[ans] <= point) {
			total += arr[ans++];
		}
		else {
			break;
		}
	}
	printf("%d", ans);
}