solution stringlengths 11 983k | difficulty int64 0 21 | language stringclasses 2
values |
|---|---|---|
def main():
(n, k,) = map(int, input().split(' '))
ta = []
tb = []
tc = []
for i in range(n):
t, a, b = map(int, input().split(' '))
if a==1 and b==1:
tc .append(t)
elif a==1:
ta.append(t)
elif b==1:
tb.append(t)
ta.sort()
... | 11 | PYTHON3 |
'''
Auther: ghoshashis545 Ashis Ghosh
College: jalpaiguri Govt Enggineering College
'''
from os import path
import sys
from functools import cmp_to_key as ctk
from collections import deque,defaultdict as dd
from bisect import bisect,bisect_left,bisect_right,insort,insort_left,insort_right
from itertools impor... | 11 | PYTHON3 |
import bisect
import collections
import copy
import functools
import heapq
import itertools
import math
import random
import re
import sys
import time
import string
from typing import *
sys.setrecursionlimit(99999)
n, k = map(int, input().split())
booksa, booksb, booksc = [], [], []
for _ in range(n):
t, a, b = ma... | 11 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
const int M = 1e2 + 100;
const int N = 2e3 + 100;
const int INF = 0x3f3f3f3f;
const int mod = 1e9 + 7;
long long n, m, t, k, x, y;
vector<long long> ab, bb, abb;
void slove() {
scanf("%lld%lld", &n, &k);
ab.clear(), bb.clear(), abb.clear();
for (int i = 0; i < n; i++)... | 11 | CPP |
n , k = input().split()
n , k = int(n) , int(k)
both = []
ali = []
bob = []
while n > 0:
t , a , b = input().split()
t , a , b = int(t) , int(a) , int(b)
if a == 1 and b == 1:
both.append(t)
elif a == 1:
ali.append(t)
elif b == 1:
bob.append(t)
n -= 1
ans = 0
both.sort(re... | 11 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
int t[200005], a[200005], b[200005];
pair<int, int> aa[200005], bb[200005], ab[200005];
int sumaa[200005], sumbb[200005], sumab[200005];
int BITcnt[10005], BITsum[10005];
int anss[200005], ccc;
vector<int> v[10005];
bool f[200005];
int lowbit(int x) { return x & (-x); }
voi... | 11 | CPP |
#include <bits/stdc++.h>
using namespace std;
const long long mod = 1e9 + 7;
const long long mod2 = 998244353;
const long long INF = 1000000001;
const long long N = 100001;
const long double PI = 3.141593;
long double powm(long long base, long long exp) {
long long ans = 1;
while (exp) {
if (exp & 1) ans = (ans... | 11 | CPP |
#include <bits/stdc++.h>
using namespace std;
const long long MAX = 3e5;
long long fen[MAX], cnt[MAX], sum[MAX];
deque<pair<long long, long long> > a, b, s, d, v;
multiset<pair<long long, long long> > sol;
void add(long long t, long long cur, long long val) {
if (cur > 2e4) return;
if (t == cur) cnt[t] += val;
if... | 11 | CPP |
#include <bits/stdc++.h>
using namespace std;
namespace IO {
const int BUFFER_SIZE = 1 << 15;
char input_buffer[BUFFER_SIZE];
size_t input_pos = 0, input_len = 0;
char output_buffer[BUFFER_SIZE];
int output_pos = 0;
char number_buffer[100];
uint8_t lookup[100];
void _update_input_buffer() {
input_len = fread(input_bu... | 11 | CPP |
n, k = map(int, input().split())
both = []
a = []
b = []
for _ in range(n):
t, ai, bi = map(int, input().split())
if ai == 1 and bi == 1:
both.append(t)
elif ai == 1:
a.append(t)
elif bi == 1:
b.append(t)
both.sort()
a.sort()
b.sort()
for l in [both,a,b]:
if len(l) < k:
... | 11 | PYTHON3 |
from sys import stdin, stdout
input = stdin.readline
print = stdout.write
n, k = map(int, input().split())
alice, bob, together = [], [], []
for _ in range(n):
t, a, b = map(int, input().split())
if a and b:
together += t,
elif a:
alice += t,
elif b:
bob += t,
sa, sb, st = len(al... | 11 | PYTHON3 |
def fn(qa, qb, qc, k):
qa.sort()
qb.sort()
qc.sort()
num = 0
ia = ib = ic = 0
na,nb,nc = len(qa),len(qb),len(qc)
for i in range(k):
if (nc == 0) or (ic >= nc):
num += qa[ia] + qb[ib]
ia += 1
ib += 1
elif (na == 0) or (nb == 0) or (ia >= n... | 11 | PYTHON3 |
import sys
input=sys.stdin.readline
n, k=map(int, input().split())
alice=[] #10
bob=[] #01
both=[] #11
for _ in range(n):
r=list(map(int, input().split()))
if r[1]==1 and r[2]==0: alice.append(r[0])
elif r[1]==0 and r[2]==1: bob.append(r[0])
elif r[1]==1 and r[2]==1: both.append(r[0])
alice.sort()
bo... | 11 | PYTHON3 |
from math import *
from copy import *
from string import * # alpha = ascii_lowercase
from random import *
from sys import stdin,stdout
from sys import maxsize
from operator import * # d = sorted(d.items(), key=itemgetter(1))
from itertools import *
from collections import Counter # d = dict(Counter(l))
import ma... | 11 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
int lim[4];
vector<pair<int, int> > t[4];
int get() {
vector<pair<int, int> > tmp;
for (int i = 0; i <= 2; i++) {
if (lim[i] != t[i].size()) {
tmp.push_back({t[i][lim[i]].first, i});
}
}
if (tmp.empty()) return 0;
sort(tmp.begin(), tmp.end());
lim[... | 11 | CPP |
#include <bits/stdc++.h>
using namespace std;
template <class T>
inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
template <class T>
inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
const long long INF = 1e11;
vector<long long... | 11 | CPP |
def solve():
import sys
nk = sys.stdin.readline().split()
n = int(nk[0])
k = int(nk[1])
A = []
B = []
both = []
for i in range(n):
t,a,b = list(map(int,sys.stdin.readline().split()))
if (a == 1 and b == 0):
A.append(t)
if (a==0 and b == 1):
B.append(t)
if (a== 1 and b == 1):
both.append(t)... | 11 | PYTHON3 |
n,k=map(int, input().split())
la=[]
lb=[]
lt=[]
a1=0
b1=0
co=0
for i in range(n):
t,a,b=map(int, input().split())
if a==1:
if b!=1:
la.append(t)
a1=a1+1
if b==1:
if a!=1:
lb.append(t)
b1=b1+1
if a==1 and b==1:
lt.append(t)
if a1<k or b1<k:
... | 11 | PYTHON3 |
import sys
reader = (s.rstrip() for s in sys.stdin)
input = reader.__next__
n,k=list(map(int,input().split()))
both = []
a = []
b = []
for _ in range(n):
t, ai, bi = map(int, input().split())
if ai == 1 and bi == 1:
both.append(t)
elif ai == 1:
a.append(t)
elif bi == 1:
b.appe... | 11 | PYTHON3 |
import sys;
import math;
def get_ints(): return map(int, sys.stdin.readline().strip().split())
def get_array(): return list(map(int, sys.stdin.readline().strip().split()))
def get_string(): return sys.stdin.readline().strip()
#def helper(n):
n,k = get_ints();
alice = [];
bob = [];
comm = [];
for i in rang... | 11 | PYTHON3 |
n,k = map(int,input().split())
same = []
different_a = []
different_b = []
for i in range(n):
t,x,y = map(int,input().split())
if x==1 and y==1:
same.append(t)
elif x==1 and y==0:
different_a.append(t)
elif y==1 and x==0:
different_b.append(t)
flag=1
if len(same)+len(different_a... | 11 | PYTHON3 |
from operator import add
class SegTree():
def __init__(self, N, e, operator_func=add):
self.e = e
self.size = N
self.node = [self.e] * (2*N)
self.operator_func = operator_func
def set_list(self, l):
for i in range(self.size):
self.node[i+self.size-1] = l[i]... | 11 | PYTHON3 |
import sys
def answer(n, k, t, a, b):
t_both = []
t_a = []
t_b = []
for i in range(n):
if a[i] == 1 and b[i] == 1:
t_both.append(t[i])
elif a[i] == 1:
t_a.append(t[i])
elif b[i] == 1:
t_b.append(t[i])
if k > ( len(t_both) + min(len(t_a), l... | 11 | PYTHON3 |
a = input().split(" ")
list1 = []
list2 = []
list3 = []
for i in range(int(a[0])):
b = input().split(" ")
if(b[1]=="1"):
if(b[2]=="1"):
list1.append(int(b[0]))
else:
list2.append(int(b[0]))
else:
if(b[2]=="1"):
list3.append(int(b[0]))
if(len(list1)... | 11 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
int const MAXN = 2e5 + 10;
int n, m, T, k;
vector<pair<int, int>> a, b, ab, other;
vector<int> ans;
int check(int mid) {
if ((int)a.size() < k - mid) return 2e9 + 1;
if ((int)b.size() < k - mid) return 2e9 + 1;
if (mid + max(0, k - mid) * 2 > m) return 2e9 + 1;
int ... | 11 | CPP |
n,k=map(int,input().split())
x=[]
y=[]
z=[]
for _ in range(n):
t,a,b=map(int,input().split())
if(a==1 and b==1):
x.append(t)
elif(a==1 and b==0):
y.append(t)
elif(a==0 and b==1):
z.append(t)
x.sort()
y.sort()
z.sort()
kk=[]
p=min(len(y),len(z))
for i in range(p):
kk.append(y... | 11 | PYTHON3 |
def prefixSum(array):
if len(array) == 0:
return []
l = [array[0]]
for i in array[1:]:
l.append(i+l[-1])
return l
n, k = map(int, input().split())
alice = []
bob = []
both = []
for i in range(n):
t, a, b = map(int, input().split())
if a == 1 and b == 1:
both.append(t)
continue
if a == 1:
alice.... | 11 | PYTHON3 |
n, k = [int(x) for x in input().split()]
both = []
bob = []
alice = []
for i in range(n):
t, a, b = [int(x) for x in input().split()]
if(a==1 and b==1):
both.append(t)
elif(a==1):
alice.append(t)
elif(b==1):
bob.append(t)
both.sort()
bob.sort()
alice.sort()
y = max(k-min(len(b... | 11 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
long long n, k, t, a, b, it1, it2, score, tim, f, s;
vector<long long> vec[4];
int main() {
cin >> n >> k;
for (int i = 1; i <= n; i++) {
cin >> t >> a >> b;
if (a == 1) f++;
if (b == 1) s++;
if (a == 0 && b == 0) continue;
if (a == 1 && b == 1) {
... | 11 | CPP |
#include <bits/stdc++.h>
using namespace std;
const int INF = 2147483640;
const int MAXN = 2e5 + 5;
const int R = 1e4 + 5;
int n, m, k;
int tot[10];
struct node {
int t, i;
} A[MAXN], B[MAXN], C[MAXN], D[MAXN], E[MAXN << 2];
bool cmp(node x, node y) { return x.t < y.t; }
struct tree {
int sum, w;
} tr[R << 2];
void... | 11 | CPP |
n,k=map(int,input().split())
l1=[] #(0,1)
l2=[] #(1,0)
l3=[] #(1,1)
for i in range(n):
t,a,b=map(int,input().split())
if (a,b)==(1,1):
l3.append(t)
elif (a,b)==(0,1):
l1.append(t)
elif (a,b)==(1,0):
l2.append(t)
s=0
l1.sort()
l2.sort()
l3.sort()
if len(l3)>=k:
s=sum(l3[:k])
p=0
p1=k-1
else:
s=sum(l3)
v=k... | 11 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
template <typename T>
void print1d(vector<T> &a) {
for (long long int i = 0; i < a.size(); i++) {
cout << a[i] << " ";
}
cout << endl;
}
vector<long long int> divisor(long long int n) {
vector<long long int> a;
for (long long int i = 1; i * i <= n; i++) {
... | 11 | CPP |
#------------------------template--------------------------#
import os
import sys
from math import *
from collections import *
from fractions import *
from bisect import *
from heapq import*
from io import BytesIO, IOBase
def vsInput():
sys.stdin = open('input.txt', 'r')
sys.stdout = open('output.txt', 'w')
BUF... | 11 | PYTHON3 |
# cook your dish here
#code
import math
import collections
from sys import stdin,stdout,setrecursionlimit
from bisect import bisect_left as bsl
from bisect import bisect_right as bsr
import heapq as hq
setrecursionlimit(2**20)
T = 1
#T = int(stdin.readline())
for _ in range(T):
#n = int(stdin.readline())
... | 11 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
const int N = 2e5 + 10;
int n, k;
struct Book {
int t, a, b;
bool operator<(const Book &w) const { return t < w.t; }
} books[N];
vector<int> a, b;
bool st[N];
int main() {
cin >> n >> k;
for (int i = 0; i < n; i++) {
cin >> books[i].t >> books[i].a >> books[i].b... | 11 | CPP |
from heapq import heappush, heappop
from sys import stdin, stdout
#
if __name__ == '__main__':
def reading_books(n, k, ta, tb, tab):
res = 0
for i in range(k):
if len(tab) == 0 and (len(ta) == 0 or len(tb) == 0):
return -1
t1 = 100000
t2 = 100... | 11 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
int main() {
long long int n, m;
cin >> n >> m;
vector<long long int> aa, bb, cc;
vector<long long int> a(n + 5);
vector<long long int> b(n + 5);
vector<long long int> c(n + 5);
for (long long int i = 1; i <= n; i++) {
cin >> a[i] >> b[i] >> c[i];
if (... | 11 | CPP |
from sys import stdin, stdout
import math
from collections import defaultdict, deque
n, k = map(int, stdin.readline().split())
al, bl, both = [], [], []
for _ in range(n):
t, a, b = map(int, stdin.readline().split())
if a == 0 and b == 0:
continue
if a == 1 and b == 1:
both.append(t)
el... | 11 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
template <typename T>
ostream &operator<<(ostream &os, const vector<T> &v) {
os << "{";
for (typename vector<T>::const_iterator vi = v.begin(); vi != v.end(); ++vi) {
if (vi != v.begin()) os << ", ";
os << *vi;
}
os << "}";
return os;
}
template <typename ... | 11 | CPP |
#include <bits/stdc++.h>
using namespace std;
long long gcd(long long a, long long b) {
if (b == 0) return a;
return gcd(b, a % b);
}
long long lcm(long long a, long long b) { return (a * b) / gcd(a, b); }
void print(vector<long long> a) {
for (int i = 0; i < a.size(); i++) {
cout << a[i] << ' ';
}
cout <... | 11 | CPP |
import sys
from functools import lru_cache, cmp_to_key
from heapq import merge, heapify, heappop, heappush
from math import *
from collections import defaultdict as dd, deque, Counter as C
from itertools import combinations as comb, permutations as perm
from bisect import bisect_left as bl, bisect_right as br, bisect
f... | 11 | PYTHON3 |
import sys
input = sys.stdin.readline
from math import ceil
(n, k) = map(int, input().split())
bob = []
alice = []
good = []
for i in range(n):
(t, a, b) = map(int, input().split())
if a == 1:
if b == 1:
good.append(t)
else:
alice.append(t)
else:
if b == 1:... | 11 | PYTHON3 |
def main():
n, k = [int(x) for x in input().split()]
alice, bob = 0, 0
both, j_a, j_b = [], [], []
for i in range(n):
b = [int(x) for x in input().split()]
if(b[1] + b[2] == 2):
both.append(b)
elif (b[1] == 1):
j_a.append(b)
elif(b[2] == 1):
... | 11 | PYTHON3 |
from collections import deque
from operator import itemgetter
from sys import stdin, stdout
int_in = lambda: int(stdin.readline())
arr_in = lambda: [int(x) for x in stdin.readline().split()]
mat_in = lambda rows: [arr_in() for _ in range(rows)]
str_in = lambda: stdin.readline().strip()
out = lambda o: stdout.write("{}... | 11 | PYTHON3 |
# cook your dish here
n,k=map(int,input().split())
a=[]
b=[]
bb=[]
x=[]
cnta=0
cntb=0
for i in range(n):
t,p,q=list(map(int,input().split()))
t=[t,p,q]
x.append(t)
t,p,q=x[i]
if p and q:
bb.append(t)
cnta+=1
cntb+=1
elif p:
a.append(t)
cnta+=1
e... | 11 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
void test_case() {
long long int n, k;
cin >> n >> k;
vector<long long int> as, bs, cs;
for (long long int i = 0; i < n; i++) {
long long int t, a, b;
cin >> t >> a >> b;
if (a + b == 2)
cs.push_back(t);
else if (a == 1)
as.push_back(t);
... | 11 | CPP |
arr=[int(x) for x in input().split()]
size=arr[0]
total=arr[1]
book_dict={'2':[],'10':[],'01':[]}
for i in range(size):
book_arr=[int(x) for x in input().split()]
if book_arr[1]==1 and book_arr[2]==1:
book_dict['2'].append(book_arr[0])
elif book_arr[1]==1 and book_arr[2]==0:
book_dict['10'].... | 11 | PYTHON3 |
def p(x):
return x[0]
n, k = map(int, input().split())
a = []
for i in range(n):
a.append(list(map(int, input().split())))
a.sort(key=p)
# print()
# print()
# for i in a:
# print(i)
alice, bob, common = [], [], []
al, bo = 0, 0
flag = 1
for i in a:
if(i[1] and not i[2] and al < k):
alice.appe... | 11 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
long long inf = 1e9;
signed main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
long long n, k;
cin >> n >> k;
vector<long long> l;
vector<long long> m;
vector<long long> r;
for (long long i = 0; i < n; ++i) {
long long a, b, c;
cin >> a >> b >... | 11 | CPP |
# JAI SHREE RAM
import math; from collections import *
import sys; from functools import reduce
def get_ints(): return map(int, input().strip().split())
def get_list(): return list(get_ints())
def getlistofstring(): return list(input().strip().split())
def printxsp(*args): return print(*args,... | 11 | PYTHON3 |
n,k = map(int,input().split())
alice = []
bob=[]
comm=[]
for _ in range(n):
a,b,c=map(int,input().split())
if(b==1 and c==1):
comm.append(a)
elif(b==1 and c==0):
alice.append(a)
elif(b==0 and c==1):
bob.append(a)
alice.sort()
bob.sort()
for i in range(min(len(alice),len(bob))):
... | 11 | PYTHON3 |
from sys import stdin
from collections import defaultdict as dd
from collections import deque as dq
import itertools as it
from math import sqrt, log, log2
from fractions import Fraction
n, k = map(int, input().split())
alike, blike = 0, 0
zero_one, one_zero, one_one, zero_zero = [], [], [], []
for i in range(n):
... | 11 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
long long mod = 1000000007;
long long dx[] = {1, -1, 0, 0};
long long dy[] = {0, 0, 1, -1};
void solve() {
long long n, k;
cin >> n >> k;
vector<long long> arr1, arr2, v;
for (long long i = 0; i < n; i++) {
long long x, a, b;
cin >> x >> a >> b;
if (a &&... | 11 | CPP |
n,k = [int(x) for x in input().split()]
books=[]
books_a=[]
books_b=[]
for i in range(n):
b = [int(x) for x in input().split()]
if b[1]==1 and b[2]==1:
books.append(b[0])
elif b[1]==1:
books_a.append(b[0])
elif b[2]==1:
books_b.append(b[0])
books_a=sorted(books_a)
books_b=s... | 11 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
const int MAX_INT = numeric_limits<int>::max();
const int MAX_UINT = numeric_limits<unsigned int>::max();
void get_acum(const vector<int>& v, vector<int>& acum) {
int sum = 0;
for (unsigned int i = 0; i < v.size(); ++i) {
acum.push_back(sum);
sum += v[i];
}
... | 11 | CPP |
#### IMPORTANT LIBRARY ####
############################
### DO NOT USE import random --> 250ms to load the library
############################
### In case of extra libraries: https://github.com/cheran-senthil/PyRival
######################
####### IMPORT #######
######################
from functools import cmp_to... | 11 | PYTHON3 |
from sys import stdin, exit
input = stdin.readline
def i(): return input()
def ii(): return int(input())
def iis(): return map(int, input().split())
def liis(): return list(map(int, input().split()))
def print_array(a): print(" ".join(map(str, a)))
n, k = iis()
alice = []
bob = []
both = []
for _ in range(n):
t, a, ... | 11 | PYTHON3 |
n,k=[int(x) for x in input().split()]
a,b,ab=[0],[0],[0]
for _ in range(n):
p,q,r=[int(x) for x in input().split()]
if q==1:
if r==1:
ab.append(p)
else:
a.append(p)
else:
if r==1:
b.append(p)
if len(ab)-1+min(len(a)-1,len(b)-1)<k: print(-1); exit()... | 11 | PYTHON3 |
from sys import stdin
input = stdin.readline
if __name__ == '__main__':
n, k = map(int, input().split())
al = []
bl = []
abl = []
for _ in range(n):
t, a, b = map(int, input().split())
if a and b:
abl.append(t)
elif a:
al.append(t)
elif b:
... | 11 | PYTHON3 |
import sys
input = sys.stdin.readline
from collections import *
n, k = map(int, input().split())
d = defaultdict(list)
for _ in range(n):
t, a, b = map(int, input().split())
if a==1 and b==1:
d[0].append(t)
elif a==1 and b==0:
d[1].append(t)
elif a==0 and b==1:
d[2].append... | 11 | PYTHON3 |
n , k = map(int , input().split())
alice = list()
bob = list()
both = list()
for i in range(n):
t, a, b = map(int , input().split())
if a == 1:
if b == 1:
both.append(t)
else:
alice.append(t)
else:
if b == 1:
bob.append(t)
alice = sorted(alice)
bob... | 11 | PYTHON3 |
n,k=map(int,input().split())
lst=[]
for i in range(n):
lst.append(list(map(int,input().split())))
alice=[]
bob=[]
same=[]
for i in lst:
if i[1]==1 and i[2]==0:
alice.append(i[0])
elif i[2]==1 and i[1]==0:
bob.append(i[0])
elif i[2]==1 and i[1]==1:
same.append(i[0])
a=len(alice)
b... | 11 | PYTHON3 |
n,k=map(int,input().split())
A,B,C=[],[],[]
for i in range(n):
t,x,y=map(int,input().split())
if(x==1 and y==1):C.append(t);continue
if(x==1):A.append(t);continue
if(y==1):B.append(t)
def fun(l):
pre=[0]
for i in l:
pre.append(pre[-1]+i)
return pre
A.sort()
B.sort()
C.sort()
a=fun(A... | 11 | PYTHON3 |
n , k = map(int , input().split())
books = []
alice = []
bobs = []
for _ in range(n):
t , a , b = map(int , input().split())
if (a== 1 and b==1):
books.append(t)
elif (a == 1):
alice.append(t)
elif (b==1):
bobs.append(t)
books = sorted(books)
alice = sorted(alice)
bobs = sor... | 11 | PYTHON3 |
from collections import defaultdict as dd
import sys
input=sys.stdin.readline
#n=int(input())
n,kk=map(int,input().split())
l=[]
ans=0
for i in range(n):
time,a,b=map(int,input().split())
l.append((time,a,b))
l.sort()
la=[]
lb=[]
do=[]
for i in l:
time,a,b=i
if(a and b):
do.append(time)
elif... | 11 | PYTHON3 |
n,k = map(int,input().split())
inf = float("inf")
a,b,c = [inf],[inf],[inf]
a_cnt,b_cnt = 0,0
for i in range(n):
u,v,w = map(int,input().split())
if v==1 and w==1:
c.append(u)
a_cnt += 1; b_cnt +=1
elif v==1:
a.append(u)
a_cnt += 1
elif w==1:
b.append(u)
b... | 11 | PYTHON3 |
from sys import*
input= stdin.readline
for _ in range(1):
n,k=map(int,input().split())
c=[]
a=[]
b=[]
for _ in range(n):
x,y,z=map(int,input().split())
if(y==1 and z==1):
c.append(x)
elif(y==1):
a.append(x)
elif(z==1):
b.append(x)
... | 11 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
vector<int> va;
vector<int> vb;
vector<int> vab;
int n, k, a, b, t;
cin >> n >> k;
for (int p = 0; p < n; p++) {
cin >> t >> a >> b;
if (a == 1 && b == 1)
vab.push_back(t);
else ... | 11 | CPP |
n,k = list(map(int,input().split()))
a11,a10,a01 = [],[],[]
c,d = 0,0
for i in range(n):
t,a,b = list(map(int,input().split()))
if a==1 and b==1:
a11.append(t)
elif a==1 and b==0:
a10.append(t)
elif a==0 and b==1:
a01.append(t)
c+=a
d+=b
a11.sort()
a10.sort()
a01.sort()
i... | 11 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
template <typename T>
void read(T &r) {
static char c;
r = 0;
for (c = getchar(); c > '9' || c < '0'; c = getchar())
;
for (; c >= '0' && c <= '9';
r = (r << 1) + (r << 3) + (c ^ 48), c = getchar())
;
}
const int maxn = 2e5 + 100;
int n, m, k;
struct ... | 11 | CPP |
import sys
import os,io
input=io.BytesIO(os.read(0,os.fstat(0).st_size)).readline
n,k=map(int,input().split())
bothlike=[]
alike=[]
blike=[]
for i in range(n):
t,a,b=map(int,input().split())
if a==1 and b==1:
bothlike.append(t)
if a==1 and b==0:
alike.append(t)
if a==0 and b==1:
blike.append(t)
if l... | 11 | PYTHON3 |
n, k = map(int, input().split())
both = []
alice = []
bob = []
for i in range(n):
t, a, b = map(int, input().split())
if a and b:
both.append(t)
elif a:
alice.append(t)
elif b:
bob.append(t)
alice.sort(reverse=True)
bob.sort(reverse=True)
both.sort(reverse=True)
def solve():
... | 11 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
const long long N = 1e9 + 5;
bool col2(pair<long long, long long> p1, pair<long long, long long> p2) {
if (p1.first == p2.first)
return p2.second < p1.second;
else
return p1.first < p2.first;
}
struct comp {
bool operator()(long long const &x, long long const ... | 11 | CPP |
#include <bits/stdc++.h>
using namespace std;
int n, k, ans;
multiset<int> alice, bob, both;
int main() {
cin >> n >> k;
for (int i = 0; i < n; i++) {
int t, a, b;
cin >> t >> a >> b;
if (a + b == 2)
both.insert(t);
else if (a)
alice.insert(t);
else if (b)
bob.insert(t);
}
... | 11 | CPP |
import sys, math
input=sys.stdin.readline
n,k=map(int,input().split())
both=[]
a=[]
b=[]
for i in range(n):
ti,ai,bi=map(int,input().split())
if ai==1 and bi==1:
both.append(ti)
elif ai==1 and bi==0:
a.append(ti)
elif ai==0 and bi==1:
b.append(ti)
both.sort()
a.sort()
b.sort()
bo... | 11 | PYTHON3 |
n , k = input().split()
n = int(n)
k = int(k)
c = []
a = []
b = []
for i in range(n):
t,al,bo = input().split()
if(al == '1' and bo == '1'):
c.append(int(t))
elif(al == '1'):
a.append(int(t))
elif(bo == '1'):
b.append(int(t))
if(len(c)+len(a) < k or len(c)+len(b) < k):
print(-1)
quit()
c.sort()
a.sort()
b... | 11 | PYTHON3 |
n,k=map(int,input().split());abt=[];at=[];bt=[]
for i in range(n):
t,a,b=map(int,input().split())
if a&b:abt.append(t)
elif a:at.append(t)
elif b:bt.append(t)
at.sort();bt.sort()
for i in range(min(len(at),len(bt))):abt.append((at[i]+bt[i]))
if len(abt)<k:print(-1)
else:print(sum(sorted(abt)[:k])) | 11 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
using pi = pair<long long, long long>;
const long long inf = (long long)2e9 + 5;
signed main() {
ios::sync_with_stdio(false);
cin.tie(0);
long long n, m, k;
cin >> n >> m >> k;
vector<pi> w[2][2];
for (long long i = 0; i < n; i++) {
long long t, a, b;
ci... | 11 | CPP |
#include <bits/stdc++.h>
using namespace std;
const int N = 200005;
long long t, n, m, k, q, a, b, x, y, ans, arr[N];
long long mod = 998244353;
string s;
int main() {
ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);
;
t = 1;
while (t--) {
cin >> n >> k;
ans = 0, x = 0, y = 0;
priority_queue<i... | 11 | CPP |
from sys import stdin,stdout
input = stdin.readline
#print = stdout.write
n,k = map(int,input().split())
com = []
a = []
b = []
for _ in range(n):
t,ai,bi = map(int,input().split())
if ai==1==bi:
com+=[t]
elif ai==1:
a+=[t]
elif bi==1:
b+=[t]
a.sort(reverse=True)
b.sort(reverse=T... | 11 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
vector<long long int> v, a1, b1;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
long long int n, k;
cin >> n >> k;
pair<long long int, pair<long long int, long long int> > p[n];
for (long long int i = 0; i < n; i++) {
long lo... | 11 | CPP |
#include <bits/stdc++.h>
using namespace std;
void solve() {
long long n, k;
cin >> n >> k;
vector<long long> v1, v2;
vector<long long> v;
for (long long i = 0; i < n; i++) {
long long t1, a, b;
cin >> t1 >> a >> b;
if (a == 1) {
if (b == 1)
v.push_back(t1);
else
v1.pus... | 11 | CPP |
[N,K] = list(map(int, input().split()))
L = [[[] for i in range(2)]for j in range(2)]
for i in range(N):
[t, a, b] = list(map(int, input().split()))
L[a][b].append(t)
INF = int(1e12)
for i in range(2):
for j in range(2):
L[i][j].sort()
for k in range(K - len(L[i][j])):
L[i][j].... | 11 | PYTHON3 |
from sys import stdin,stdout
from math import gcd,sqrt
from collections import deque
input=stdin.readline
R=lambda:map(int,input().split())
I=lambda:int(input())
S=lambda:input().rstrip('\n')
L=lambda:list(R())
P=lambda x:stdout.write(x)
hg=lambda x,y:((y+x-1)//x)*x
pw=lambda x:1 if x==1 else 1+pw(x//2)
chk=lambda x:ch... | 11 | PYTHON3 |
from collections import deque
n,k=map(int,input().split())
s,s1,s2=deque(),deque(),deque()
for i in range(n):
a,b,c=map(int,input().split())
if(b==1)and(c==1):
s.append(a)
elif(b==1)and(c==0):
s1.append(a)
elif(b==0)and(c==1):
s2.append(a)
x,y=0,0
sum=0
s1=deque(sorted(s1))
s2=de... | 11 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
bool comp(pair<int, pair<int, int> > a, pair<int, pair<int, int> > b) {
return a.first < b.first;
}
int main() {
int n, k;
cin >> n >> k;
vector<pair<int, pair<int, int> > > book;
for (int i = 0; i < n; i++) {
pair<int, pair<int, int> > temp;
cin >> temp.f... | 11 | CPP |
import math,string,itertools,fractions,heapq,collections,re,array,bisect,sys,copy,functools
# import time,random,resource
# sys.setrecursionlimit(10**6)
inf = 10**20
eps = 1.0 / 10**10
mod = 10**9+7
mod2 = 998244353
dd = [(-1,0),(0,1),(1,0),(0,-1)]
ddn = [(-1,0),(-1,1),(0,1),(1,1),(1,0),(1,-1),(0,-1),(-1,-1)]
def LI(... | 11 | PYTHON3 |
from sys import stdin,stdout
input = stdin.readline
from collections import deque as dq
mp = lambda : map(int,input().split())
it = lambda: int(input())
a,b = mp()
comman =[]
alice =[]
bob =[]
for books in range(a):
t,x,y = mp()
if x==y==1:
comman.append(t)
elif x&1:
alice.append(t)
elif y&1 :
bob.append(t)
c... | 11 | PYTHON3 |
R=lambda:map(int,input().split())
s=sorted
n,k=R()
_,u,v,w=l=[[],[],[],[]]
for _ in[0]*n:t,a,b=R();l[2*a+b]+=t,
a=*map(sum,zip(s(u),s(v))),*w
print(sum((s(a)+[-sum(a)-1])[:k])) | 11 | PYTHON3 |
n, k = map(int, input().split())
alice = []
bob = []
both = []
for _ in range(n):
t, a, b = map(int, input().split())
if a == 1 and b == 1:
both.append((t, a, b))
elif a == 1 and b == 0:
alice.append((t, a, b))
elif a == 0 and b == 1:
bob.append((t, a, b))
alice.sort()
bob.so... | 11 | PYTHON3 |
import sys
n, k = map(int, input().split())
a = []
b = []
g = []
for i in range(n):
t, x, y = map(int, input().split())
if x and y:
a.append(t)
elif x:
g.append(t)
elif y:
b.append(t)
a.sort()
b.sort()
g.sort()
t = 0
i = 0
j = 0
for o in range(k):
if i < len(a) and j < min(l... | 11 | PYTHON3 |
# from functools import lru_cache
from sys import stdin, stdout
import sys
from math import *
# from collections import deque
# sys.setrecursionlimit(3*int(1e5))
# input = stdin.buffer.readline
# print = stdout.write
# @lru_cache()
n,k=map(int,input().split())
a=[]
bt=[]
b=[]
for i in range(n):
x,y,z=map(int,input... | 11 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
long long n, m, d, nn = 0, ttl = 0, fq[4], sm = 0, dd, sq[200069], zs = 0,
inf = 1e18;
pair<long long, long long> a[4][200069];
multiset<pair<long long, long long>> ms[2];
multiset<pair<long long, long long>>::iterator it;
void blc() {
for (; nn < dd &&... | 11 | CPP |
from sys import *
n, k = [int(x) for x in stdin.readline().split()]
lk1 = []
lk2 = []
lk3 = []
for _ in range (n):
time, x, y = [int(x) for x in stdin.readline().split()]
if x == 1 and y == 1:
lk3.append(time)
elif x == 1:
lk1.append(time)
elif y == 1:
lk2.append(time)
lk1.so... | 11 | PYTHON3 |
from heapq import *
from collections import *
import os
import sys
from io import BytesIO, IOBase
import math
ins = lambda: [int(x) for x in input()]
inp = lambda: int(input())
inps = lambda: [int(x) for x in input().split()]
def main():
#dd
n,k=inps()
bks=[[0] for i in range(4)]
for i in range... | 11 | PYTHON3 |
#!/usr/bin/env python3
import sys
import heapq
input=sys.stdin.readline
n,k=map(int,input().split())
arr=[list(map(int,input().split())) for _ in range(n)]
cnt1=0
cnt2=0
for t,a,b in arr:
if a==1:
cnt1+=1
if b==1:
cnt2+=1
if cnt1<k or cnt2<k:
print(-1)
exit()
arr=sorted(arr,key=lambda ... | 11 | PYTHON3 |
n,k = map(int, input().split())
alice = []
bob = []
common = []
for i in range(n):
t, a, b = map(int, input().split())
if a and b:
common.append(t)
elif a:
alice.append(t)
elif b:
bob.append(t)
alice.sort()
bob.sort()
for i in range(min(len(alice), len(bob))):
common.append(alice[i]+bob[i])
if len(common)<k:... | 11 | PYTHON3 |
n,k=map(int,input().split())
z=[]
x=[]
y=[]
for i in range(n):
t,a,b=map(int,input().split())
if a&b:
z.append(t)
elif a:
x.append(t)
elif b:
y.append(t)
x.sort()
y.sort()
for i in range(min(len(x),len(y))):
z.append(x[i]+y[i])
if len(z)<k:
print(-1)
else:
print(sum(s... | 11 | PYTHON3 |
#include <bits/stdc++.h>
const int INF = 2e9 + 1;
int main() {
std::ios::sync_with_stdio(false);
std::cin.tie(NULL);
int n, k;
std::cin >> n >> k;
std::vector<int> t(n), a(n), b(n);
std::vector<int> v[2][2];
for (int i = 0; i < n; i++) {
std::cin >> t[i] >> a[i] >> b[i];
v[a[i]][b[i]].push_back(t[... | 11 | CPP |
#include <bits/stdc++.h>
using namespace std;
const int INF = 0x3f3f3f3f, MAXN = 2e6 + 50;
const long long LINF = 2e9 + 1000, MOD = 998244353;
const double Pi = acos(-1), EPS = 1e-6;
void test() { cerr << "\n"; }
template <typename T, typename... Args>
void test(T x, Args... args) {
cerr << x << " ";
test(args...);... | 11 | CPP |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.