solution
stringlengths 11
983k
| difficulty
int64 0
21
| language
stringclasses 2
values |
|---|---|---|
#include <bits/stdc++.h>
using namespace std;
long long inf = 1e9 + 7;
signed main() {
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
{
long long n, d, fm = 0;
cin >> n >> d;
pair<long long, long long> a[n];
long long f[n];
for (long long i = 0; i < n; i++) {
cin >> a[i].first >> a[i].second;
}
sort(a, a + n);
f[0] = a[0].second;
for (long long i = 1; i < n; i++) {
f[i] = f[i - 1] + a[i].second;
}
long long i = 0, j = 0;
while (j < n) {
while (a[j].first - a[i].first >= d) {
i++;
}
if (a[j].first - a[i].first < d) {
if (i != 0) {
fm = max(fm, f[j] - f[i - 1]);
} else {
fm = max(fm, f[j]);
}
j++;
}
}
cout << fm << endl;
}
return 0;
}
| 8 | CPP |
def main(n, d):
p = []
for i in range(n):
a, b = map(int, input().split())
p.append([a, b])
p.sort()
maxi = 0
sum = 0
e = []
g = 0
em = 0
while len(p) != 0:
while g != n and p[g][0] < p[em][0] + d:
sum += p[g][1]
g += 1
if g == n:
maxi = max(maxi, sum)
print(max(maxi, sum))
break
else:
maxi = max(maxi, sum)
while em != g and p[em][0] + d <= p[g][0]:
sum -= p[em][1]
em += 1
n, d = map(int, input().split())
main(n, d)
| 8 | PYTHON3 |
n,d=map(int,input().split())
s=[0]*n
for _ in range(n):
m,f=map(int,input().split())
s[_]=(m,f)
s.sort()
i=0;j=0
ans=0
fr=0
while j<n:
if s[j][0]-s[i][0]<d :
fr+=s[j][1]
j+=1
else:
ans=max(ans,fr)
while s[j][0]-s[i][0]>=d:
fr-=s[i][1]
i+=1
ans=max(ans,fr)
print(ans)
| 8 | PYTHON3 |
def solve(inp, d):
inp = sorted(inp, key=lambda x: x[0])
p1 = 0
p2 = 0
n = len(inp)
maxfnd = 0
max1 = maxfnd
while p2 < n:
if inp[p2][0] - inp[p1][0] < d:
maxfnd += inp[p2][1]
p2 += 1
else:
maxfnd -= inp[p1][1]
p1 += 1
max1 = max(max1, maxfnd)
return max1
n, s = map(int, input().split())
in1 = []
for i in range(n):
in1.append(list(map(int, input().split())))
print(solve(in1, s))
| 8 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
const long long N = 2e5 + 5;
const long long mod = 1e9 + 7;
const long long INF = 0x7f7f7f7f7f7f7f7f;
const int INFi = 0x7f7f7f7f;
long long n, d, mx = 0;
vector<pair<long long, long long> > a;
void solve() {
cin >> n >> d;
for (int i = 1; i <= n; i++) {
int x, y;
cin >> x >> y;
a.push_back({x, y});
}
sort(a.begin(), a.end());
long long res = 0;
for (int i = 0, j = 0; i < n; i++) {
res += a[i].second;
while (a[i].first - a[j].first >= d) {
res -= a[j].second;
j++;
}
mx = max(mx, res);
}
cout << mx << "\n";
}
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
cout << fixed;
cout << setprecision(15);
;
int test = 1;
for (int i = 1; i <= test; i++) {
solve();
}
}
| 8 | CPP |
#import sys
#sys.stdin = open("python/in", "r")
#from collections import defaultdict
#import numpy as np
#import array as rr
#arr = rr.array('q')
#n = int(input())
friend = []
n, d = [int (i) for i in input().split(" ")]
for i in range (n):
friend.append([int (i) for i in input().split(" ")])
friend = sorted(friend, key = lambda fr: fr[0])
ans = 0
cur = 0
rich = iter(friend)
i = next(rich)
for poor in friend:
try:
while i[0] < poor[0] + d:
cur += i[1]
i = next(rich)
ans = max(ans, cur)
#print("debug like a noob")
cur -= poor[1]
except StopIteration:
#print("breaking")
break
ans = max(ans, cur)
print (ans)
| 8 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
const long long int N = 1e6 + 7;
bool comp(const pair<long long, long long> &i,
const pair<long long, long long> &j) {
return i.second > j.second;
}
int main() {
ios_base::sync_with_stdio(0);
cin.tie(NULL);
cout.tie(NULL);
int n;
long long d, num, c = 0, x, y, res = 0;
cin >> n >> d;
std::vector<pair<long long, long long> > a;
a.push_back(make_pair(0, 0));
for (int i = (0); i < n; i++) {
cin >> x >> y;
a.push_back(make_pair(x, y));
}
long long temp2, t = 0;
sort(a.begin(), a.end());
vector<long long> v(n + 2, 0), v1(n + 1, 0);
for (int i = (1); i < n + 1; i++) {
v[i] += (v[i - 1] + a[i].second);
v1[i] = a[i].first;
}
for (int i = (1); i < n + 1; i++) {
num = v1[i] + d;
int temp = lower_bound(v1.begin() + i, v1.end(), num) - v1.begin();
if (temp == n + 1) temp--;
if (v1[temp] >= num) temp--;
temp2 = v[temp] - v[i - 1];
t = max(temp2, t);
}
cout << t;
return 0;
}
| 8 | CPP |
#include <bits/stdc++.h>
using namespace std;
const int N = 1e5 + 5;
int n;
long long d, dp[N];
pair<long long, long long> arr[N];
bool cmp(pair<long long, long long> a, pair<long long, long long> b) {
return a.first < b.first;
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
cin >> n >> d;
for (int i = 1; i <= n; i++) {
long long a, b;
cin >> a >> b;
arr[i] = {a, b};
}
sort(arr + 1, arr + 1 + n, cmp);
dp[1] = arr[1].second;
for (int i = 2; i <= n; i++) {
dp[i] = dp[i - 1] + arr[i].second;
}
long long answer = -1;
for (int i = 1; i <= n; i++) {
long long target = arr[i].first + d - 1;
int l = 1;
int r = n;
int ans = -1;
while (l <= r) {
int mid = l + (r - l) / 2;
if (arr[mid].first <= target) {
ans = mid;
l = mid + 1;
} else {
r = mid - 1;
}
}
answer = max(answer, dp[ans] - dp[i - 1]);
}
cout << answer << '\n';
return 0;
}
| 8 | CPP |
def solve(m, d):
m.sort()
res = 0
curr = 0
i, j = 0, 0
while j < len(m):
if m[j][0] - m[i][0] >= d:
curr -= m[i][1]
i += 1
else:
curr += m[j][1]
res = max(res, curr)
j += 1
return res
n, d = map(int, input().split())
f = []
for i in range(n):
mi, fi = map(int, input().split())
f.append((mi, fi))
print(solve(f, d)) | 8 | PYTHON3 |
n, d = map(int,input().split())
v = sorted([list(map(int,input().split())) for i in range(n)], key = lambda x: x[0])
sum = v[0][1]
sol = v[0][1]
b = 0
for i in range(1,n):
while v[i][0] >= d + v[b][0]:
sum -= v[b][1]
b += 1
sum += v[i][1]
sol = max(sum,sol)
print(sol) | 8 | PYTHON3 |
l = input()
l = l.split()
# print(l)
n = int(l[0])
d = int(l[1])
lst = []
for i in range(n):
l = input()
l = l.split()
lst.append((int(l[0]), int(l[1])))
# print(lst, n, d)
lst.sort(key=lambda x: x[0])
# print(lst)
sum, maxim, start, fin = 0, 0, 0, 0
while fin < n:
while fin < n and lst[fin][0] - lst[start][0] + 1 <= d:
sum += lst[fin][1]
fin += 1
maxim = max(maxim, sum)
sum -= lst[start][1]
start += 1
#print(lst)
print(maxim)
| 8 | PYTHON3 |
import random, math
from copy import deepcopy as dc
from bisect import bisect_left, bisect_right
# Function to call the actual solution
def solution(pairs, d):
pairs.sort(key = lambda x: x[0])
i = 0
# Finding Prefix sum
pre = []
prek = []
sk = 0
for i in range(len(pairs)):
sk += pairs[i][1]
pre.append(pairs[i][0])
prek.append(sk)
# print(pre, prek)
maxi = float('-inf')
for i in range(len(pairs)):
mid = bisect_right(pre, pre[i] + d - 1, i+1, len(pairs))
m = prek[mid-1]
if i != 0:
m -= prek[i-1]
if m > maxi:
maxi = dc(m)
# print(m, mid, maxi)
return maxi
# Function to take input
def input_test():
n, d = map(int, input().strip().split(" "))
pairs = []
for i in range(n):
li = list(map(int, input().strip().split(" ")))
pairs.append(li)
out = solution(pairs, d)
print(out)
input_test()
# test() | 8 | PYTHON3 |
import sys
input = sys.stdin.readline
def check(num):
i,j = 0,0
count = 0
while j<n:
while j<n and (a[j][0]-a[i][0])<d:
count += a[j][1]
j += 1
if count>=num:
return True
count -= a[i][1]
i += 1
return False
n,d = map(int,input().split())
a = []
maxx = 0
for i in range(n):
a.append(list(map(int,input().split())))
maxx += a[-1][1]
a.sort()
if n==1:
print (a[0][1])
exit()
low = 0
high = maxx
while low<high:
mid = (low+high)//2
if check(mid):
low = mid+1
else:
high = mid-1
if check(low):
print (low)
else:
print (low-1) | 8 | PYTHON3 |
import sys
input=sys.stdin.readline
from bisect import bisect_right as bi
n,d=list(map(int,input().split()))
a=[]
for i in range(n):
a.append(list(map(int,input().split())))
a.sort()
b=[]
c=[0]
s=0
for i in range(n):
b.append(a[i][0])
s+=a[i][1]
c.append(s)
c.append(s)
f=[]
for i in range(n):
e=bi(b,b[i]+d-1)
g=c[e]-c[i]
f.append(g)
print(max(f)) | 8 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
int gcd(int a, int b) {
if (b == 0) return a;
return gcd(b, a % b);
}
int main() {
int n, d;
cin >> n >> d;
pair<int, int> a[n];
long long int b[n + 1], max1 = 0, c[n];
b[0] = 0;
for (int i = 0; i < n; ++i) {
cin >> a[i].first >> a[i].second;
}
sort(a, a + n);
for (int i = 0; i < n; ++i) {
b[i + 1] = b[i] + a[i].second;
c[i] = a[i].first;
}
for (int i = 0; i < n; ++i) {
int index = lower_bound(c, c + n, c[i] + d) - c;
max1 = max(max1, b[index] - b[i]);
}
cout << max1;
return 0;
}
| 8 | CPP |
n, d = list(map(int, input().split()))
res = []
for i in range(n):
res.append(list(map(int, input().split())))
res.sort()
res.reverse()
res.append([0, 0])
left = 0
right = 0
summ = 0
rsumm = 0
while True:
while res[left][0] - d < res[right][0]:
summ += res[right][1]
right += 1
if right == n + 1:
break
if right == n + 1:
break
rsumm = max(summ, rsumm)
summ -= res[left][1]
left += 1
rsumm = max(summ, rsumm)
print(rsumm) | 8 | PYTHON3 |
n, diff = map(int, input().split())
a = sorted([tuple(map(int, input().split())) for _ in range(n)])
left = right = 0
ret = 0
s = 0
while right < n:
while right < n and a[right][0] - a[left][0] < diff:
s += a[right][1]
right += 1
ret = max(ret, s)
if right == n:
break
s += a[right][1]
while left <= right and a[right][0] - a[left][0] >= diff:
s -= a[left][1]
left += 1
right += 1
ret = max(ret, s)
print(ret) | 8 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
bool comp(const pair<int, long long>& a, const pair<int, long long>& b) {
return a.second < b.second;
}
vector<pair<int, long long> > pairs;
vector<pair<int, long long> > indices;
int main() {
int n;
long long d;
cin >> n >> d;
pairs.resize(n);
indices.resize(n);
long long m, s;
for (int i = 0; i < n; i++) {
cin >> m >> s;
pairs[i].first = s;
pairs[i].second = m;
indices[i].first = i + 1;
indices[i].second = pairs[i].second;
}
sort(pairs.begin(), pairs.end(), comp);
sort(indices.begin(), indices.end(), comp);
long long p[100001] = {0};
for (int i = 1; i < n + 1; i++) {
p[i] = p[i - 1] + pairs[i - 1].first;
}
long long maxi = 0;
for (int i = 0; i < n; i++) {
int first, last, mid;
first = 0;
last = n;
while (first < last) {
mid = (first + last) / 2;
if (pairs[mid].second >= pairs[i].second + d) {
last = mid;
} else {
first = mid + 1;
}
}
long long f = p[first] - p[i];
if (f > maxi) {
maxi = f;
}
}
cout << maxi << endl;
}
| 8 | CPP |
n, d = map(int, input().split())
m_s = sorted(tuple(map(int, input().split())) for _ in range(n))
s, max_s, i = 0, 0, 0
for j in range(n):
s += m_s[j][1]
while m_s[j][0] - m_s[i][0] >= d:
s -= m_s[i][1]
i += 1
max_s = max(max_s, s)
print(max_s) | 8 | PYTHON3 |
# |
# _` | __ \ _` | __| _ \ __ \ _` | _` |
# ( | | | ( | ( ( | | | ( | ( |
# \__,_| _| _| \__,_| \___| \___/ _| _| \__,_| \__,_|
import sys
import math
import operator as op
from functools import reduce
def read_line():
return sys.stdin.readline()[:-1]
def read_int():
return int(sys.stdin.readline())
def read_int_line():
return [int(v) for v in sys.stdin.readline().split()]
def read_float_line():
return [float(v) for v in sys.stdin.readline().split()]
def ncr(n, r):
r = min(r, n-r)
numer = reduce(op.mul, range(n, n-r, -1), 1)
denom = reduce(op.mul, range(1, r+1), 1)
return numer / denom
# t = read_int()
t = 1
for i in range(t):
n, d = read_int_line()
li = []
for i in range(n):
m,f = read_int_line()
li.append([m,f])
li = sorted(li,key=lambda x:x[0])
l = 0
r = 0
ans = -1
cur = 0
while l<=r and r<n:
while l<=r and abs(li[l][0] - li[r][0])>=d:
cur-=li[l][1]
l+=1
while r<n and abs(li[l][0] - li[r][0])<d:
cur += li[r][1]
r+=1
ans = max(ans,cur)
print(ans)
| 8 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
int32_t main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
long long n, d;
cin >> n >> d;
vector<pair<long long, long long>> v;
for (long long i = 0; i < n; i++) {
long long a, b;
cin >> a >> b;
v.push_back({a, b});
}
sort(v.begin(), v.end());
vector<long long> sum(n);
sum[0] = v[0].second;
for (long long i = 1; i < n; i++) {
sum[i] = v[i].second + sum[i - 1];
}
long long ans = 0;
for (long long i = 0; i < n; i++) {
pair<long long, long long> it = {v[i].first + d, 0};
long long index = lower_bound(v.begin(), v.end(), it) - v.begin();
if (i == 0)
ans = sum[index - 1];
else {
ans = max(sum[index - 1] - sum[i - 1], ans);
}
}
cout << ans << endl;
return 0;
}
| 8 | CPP |
#include <bits/stdc++.h>
using namespace std;
struct node {
int m, s;
} a[100005];
bool cmp(node a, node b) { return a.m < b.m; }
long long sum[100005];
int main() {
int n, d;
scanf("%d%d", &n, &d);
for (int i = 1; i <= n; i++) scanf("%d%d", &a[i].m, &a[i].s);
sort(a + 1, a + n + 1, cmp);
sum[0] = 0;
for (int i = 1; i <= n; i++) sum[i] = sum[i - 1] + a[i].s;
long long ans = 0;
for (int i = 1; i <= n; i++) {
int l = i, r = n;
int mid;
while (l < r) {
mid = (l + r) >> 1;
if (a[mid].m - a[i].m >= d)
r = mid - 1;
else
l = mid + 1;
}
if (a[l].m - a[i].m >= d) l--;
ans = max(ans, sum[l] - sum[i - 1]);
}
printf("%I64d\n", ans);
return 0;
}
| 8 | CPP |
firstLineInput = input()
firstLineInput = firstLineInput.split(' ')
repetition = int(firstLineInput[0])
dick = int(firstLineInput[1])
friendship= []
i=0
while i != repetition:
friendInput = input()
friendInput = friendInput.split(' ')
friendship.append([int(friendInput[0]),int(friendInput[1])])
i+=1
friendship.sort()
start = 0
end =0
ref =0
n = len(friendship)
totalSum =0
# 1 as money
# 2 as friendship
while end < n:
while end < n and friendship[end][0] - friendship[start][0] < dick:
totalSum += friendship[end][1]
end +=1
if totalSum > ref:
ref = totalSum
totalSum -= friendship[start][1]
start +=1
print(ref)
| 8 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
int main() {
unsigned int n, d;
while (cin >> n >> d) {
vector<pair<unsigned long long, unsigned long long>> ms(n);
for (size_t i = 0; i < n; ++i) cin >> ms[i].first >> ms[i].second;
sort(ms.begin(), ms.end());
unsigned long long factor = ms[0].second;
size_t left = 0, right = 1;
unsigned long long result = factor;
while (right < n) {
while (right < n && ms[right].first - ms[left].first < d)
factor += ms[right].second, ++right;
result = max(result, factor);
factor -= ms[left].second;
++left;
}
cout << result << endl;
}
}
| 8 | CPP |
#include <bits/stdc++.h>
using namespace std;
const int N = 100009;
int n, d;
long long b[N] = {};
pair<int, int> a[N];
int main() {
scanf("%d%d", &n, &d);
for (int i = 1; i <= n; i++) scanf("%d%d", &a[i].first, &a[i].second);
sort(a + 1, a + n + 1);
for (int i = 1; i <= n; i++) b[i] = b[i - 1] + a[i].second;
long long ans = 0;
for (int l = 1, r = 1; r <= n; r++) {
while (a[r].first - a[l].first >= d) l += 1;
ans = max(ans, b[r] - b[l - 1]);
}
printf("%I64d\n", ans);
return 0;
}
| 8 | CPP |
# https://vjudge.net/contest/319995#problem/C
n, money = [ int(x) for x in input().split() ]
data = []
for i in range(n):
d = [ int(x) for x in input().split() ]
data.append(d)
data.sort(key=lambda x: x[0])
i, j, soma, soma_parcial = 0, 1, data[0][1], data[0][1]
while j < n and i < n:
if abs(data[i][0] - data[j][0]) < money:
soma_parcial += data[j][1]
j += 1
else:
soma_parcial -= data[i][1]
i += 1
if soma_parcial > soma:
soma = soma_parcial
print(soma) | 8 | PYTHON3 |
line = input()
n, d = map(int, line.split())
ms = []
for i in range(n):
line = input()
tmp = list(map(int, line.split()))
ms.append(tmp)
#print(tmp)
#print(ms)
#print(ms[0])
ms = sorted(ms, key = lambda ms: ms[0])
#print(ms)
i = 0
j = 0
ans = 0
while j < n and abs(ms[i][0] - ms[j][0]) < d:
ans += ms[j][1]
j += 1
maxx = ans
while j < n:
ans += ms[j][1]
while abs(ms[i][0] - ms[j][0]) >= d:
ans -= ms[i][1]
i += 1
if maxx < ans:
maxx = ans
j += 1
print(maxx)
| 8 | PYTHON3 |
# #!/usr/bin/env python
# import os
# import sys
# from io import BytesIO, IOBase
# def main():
# pass
# # region fastio
# BUFSIZE = 8192
# class FastIO(IOBase):
# newlines = 0
# def __init__(self, file):
# self._fd = file.fileno()
# self.buffer = BytesIO()
# self.writable = "x" in file.mode or "r" not in file.mode
# self.write = self.buffer.write if self.writable else None
# def read(self):
# while True:
# b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
# if not b:
# break
# ptr = self.buffer.tell()
# self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)
# self.newlines = 0
# return self.buffer.read()
# def readline(self):
# while self.newlines == 0:
# b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
# self.newlines = b.count(b"\n") + (not b)
# ptr = self.buffer.tell()
# self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)
# self.newlines -= 1
# return self.buffer.readline()
# def flush(self):
# if self.writable:
# os.write(self._fd, self.buffer.getvalue())
# self.buffer.truncate(0), self.buffer.seek(0)
# class IOWrapper(IOBase):
# def __init__(self, file):
# self.buffer = FastIO(file)
# self.flush = self.buffer.flush
# self.writable = self.buffer.writable
# self.write = lambda s: self.buffer.write(s.encode("ascii"))
# self.read = lambda: self.buffer.read().decode("ascii")
# self.readline = lambda: self.buffer.readline().decode("ascii")
# sys.stdin, sys.stdout = IOWrapper(sys.stdin), IOWrapper(sys.stdout)
# input = lambda: sys.stdin.readline().rstrip("\r\n")
# # endregion
# if __name__ == "__main__":
# main()
n,d = map(int,input().split())
l = []
for _ in range(n):
l.append(tuple(map(int,input().split())))
l.sort()
ans=0
a=[]
i=0
j=0
while i<n:
if l[i][0]-l[j][0]>=d:
a.append(ans)
ans-=l[j][1]
j+=1
else:
ans+=l[i][1]
a.append(ans)
i+=1
print(max(a)) | 8 | PYTHON3 |
from sys import stdin
live = True
if not live: stdin = open('data.in', 'r')
n, limit = list(map(int, stdin.readline().strip().split()))
friends = []
for i in range(n):
m, s = list(map(int, stdin.readline().strip().split()))
friends += [(m, s)]
friends = sorted(friends, key = lambda t: t[0])
ans = temp = friends[0][1]
start = 0
for i, j in friends[1:]:
if temp > ans: ans = temp
temp += j
while not (i - friends[start][0] < limit):
temp -= friends[start][1]
start += 1
if temp > ans: ans = temp
print(ans)
if not live: stdin.close() | 8 | PYTHON3 |
from collections import deque
n, d = map(int, input().split())
friends = sorted(tuple(map(int, input().split())) for _ in range(n))
ss = deque()
mm = deque()
ff = 0
ans = 0
for m, s in friends:
ss.append(s)
mm.append(m)
ff += s
while mm[0]+d <= mm[-1]:
ff -= ss.popleft()
mm.popleft()
ans = max(ans, ff)
print(ans) | 8 | PYTHON3 |
n,d= map(int,input().split())
money=[]
dic={}
for _ in range(n):
m,s=map(int,input().split())
money.append(m)
if m in dic:
dic[m].append(s)
else:
dic[m]=[s]
money.sort()
f=[]
money1= sorted(list(set(money)))
for i in money1:
for j in dic[i]:
f.append(j)
money=[None]+money
f=[None]+f
pref=[0 for i in range(n+1)]
for i in range(1,n+1):
pref[i]=f[i]+pref[i-1]
i=1
j=1
final=[]
while j<=n and i<=n:
if money[j]-money[i]<d:
if j==n:
final.append(pref[j]-pref[i-1])
j+=1
else:
final.append(pref[j-1]-pref[i-1])
i+=1
print(max(final))
| 8 | PYTHON3 |
# Author: S Mahesh Raju
# Username: maheshraju2020
# Date: 30/04/2020
from sys import stdin,stdout
from math import gcd, ceil, sqrt
ii1 = lambda: int(stdin.readline().strip())
is1 = lambda: stdin.readline().strip()
iia = lambda: list(map(int, stdin.readline().strip().split()))
isa = lambda: stdin.readline().strip().split()
mod = 1000000007
n, d = iia()
frds = []
for _ in range(n):
frds.append(iia())
frds.sort()
res = float("-inf")
tot = frds[0][1]
p = 0
for i in range(1, n):
while frds[i][0] - frds[p][0] >= d:
res = max(res, tot)
tot -= frds[p][1]
p += 1
tot += frds[i][1]
res = max(res,tot)
print(res)
| 8 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
const int N = 100005;
int n, d;
pair<int, int> f[N];
int main() {
scanf("%d%d", &n, &d);
for (int i = 1; i <= n; ++i) scanf("%d%d", &f[i].first, &f[i].second);
sort(f + 1, f + n + 1);
int uk = 1;
long long mx = 0, cur_sum = 0;
for (int i = 1; i <= n; ++i) {
while (uk <= n && f[uk].first - f[i].first < d) {
cur_sum += f[uk].second;
++uk;
}
mx = max(mx, cur_sum);
cur_sum -= f[i].second;
}
cout << mx << endl;
return 0;
}
| 8 | CPP |
a,b=map(int,input().split())
c=0
f=0
d=0
e=list()
for _ in range(a):
g,h=map(int,input().split())
e.append([g,h])
e.sort()
for i in range(a):
c=c+e[i][1]
while e[i][0]-e[d][0]>=b:
c=c-e[d][1]
d=d+1
f=max(f,c)
print(f) | 8 | PYTHON3 |
# d - money difference
# l[i][0] - money
# l[i][1] - friendship factor
n, d = input().split()
n, d = int(n), int(d)
l = []
for _ in range(n):
x = input().split()
l.append((int(x[0]),int(x[1])))
def key(pair):
return pair[0]
l.sort(key = key)
i = 0
j = 0
sum = 0
max = 0
while i < n and j < n:
if l[j][0] - l[i][0] >= d:
sum -= l[i][1]
i-=-1
else:
sum += l[j][1]
j-=-1
if sum > max:
max = sum
print(max) | 8 | PYTHON3 |
n, d = [int(i) for i in input().split()]
a = [0] * n
for i in range(n):
a[i] = [int(j) for j in input().split()]
a.sort()
i = 0; j = 0; ans = 0
c = 0
for j in range(0, n):
if (j > 0):
c -= a[j - 1][1]
while (i < n):
if a[i][0] - a[j][0] < d:
c += a[i][1]
i += 1
else:
break
ans = max(c, ans)
print(ans)
| 8 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
vector<pair<long long, long long> > A;
long long n, d, a, b, ps = 1, ans;
long long pre[100001];
int main() {
cin >> n >> d;
A.push_back({0, 0});
for (int i = 1; i <= n; i++) {
cin >> a >> b;
A.push_back({a, b});
}
sort(A.begin(), A.end());
for (int i = 1; i <= n; i++) {
pre[i] = pre[i - 1] + A[i].second;
if (A[i].first - A[ps].first >= d) {
while (1) {
ps++;
if (A[i].first - A[ps].first < d) break;
}
}
ans = max(ans, pre[i] - pre[ps - 1]);
}
cout << ans << endl;
}
| 8 | CPP |
n, d = map(int, input().split())
arr = sorted(list(map(int, input().split())) for _ in range(n))
s, max_s, i = 0, 0, 0
for j in range(n):
s += arr[j][1]
while arr[j][0] - arr[i][0] >= d:
s -= arr[i][1]
i += 1
max_s = max(max_s, s)
print(max_s)
| 8 | PYTHON3 |
#!/usr/bin/env python3
import atexit
import io
import sys
_I_B = sys.stdin.read().splitlines()
input = iter(_I_B).__next__
_O_B = io.StringIO()
sys.stdout = _O_B
@atexit.register
def write():
sys.__stdout__.write(_O_B.getvalue())
def main():
n,d=map(int,input().split())
a=[]
for i in range(n):
a.append(tuple(map(int,input().split())))
a.sort()
l=0
r=0
ff=0
mff=0
while l<=r and r<n:
if a[r][0]-a[l][0]<d:
ff+=a[r][1]
mff=max(ff,mff)
r+=1
else:
ff-=a[l][1]
l+=1
print(mff)
if __name__=='__main__':
main() | 8 | PYTHON3 |
n,d=map(int,input().split())
arr = []
for i in range(n):
arr.append(list(map(int,input().split())))
arr.sort(key = lambda arr:arr[0])
maxx = 0
left = 0
right = 0
curr = 0
while right <n and left<n:
if abs(arr[left][0]-arr[right][0]) <d:
curr += arr[right][1]
right+=1
else:
curr -= arr[left][1]
left+=1
maxx=max(curr,maxx)
print (maxx)
| 8 | PYTHON3 |
n, d = [int(i) for i in input().split()]
friends = [[0, 0] for i in range(n)]
for i in range(n):
a = input().split()
friends[i][0] = int(a[0])
friends[i][1] = int(a[1])
friends.sort()
l = 0
r = 0
result = 0
add = 0
while (l < n and r < n):
while (r < n and ((friends[r][0] - friends[l][0]) < d)):
add += friends[r][1]
r += 1
result = max(result, add)
add -= friends[l][1]
l += 1
print(result) | 8 | PYTHON3 |
def find_index(arr, num, low, high, best):
mid = (low + high) // 2
if low > high:
return best
if arr[mid][0] >= num:
return find_index(arr, num, low, mid - 1, best)
return find_index(arr, num, mid + 1, high, mid)
n, d = map(int, input().split())
arr = [tuple(map(int, input().split())) for _ in range(n)]
arr.sort(key = lambda x: x[0])
s = [arr[0][1]]
ans = 0
for i in range(1, n):
s.append(s[i - 1] + arr[i][1])
s += [0]
for i in range(n):
j = find_index(arr, arr[i][0] + d, i, n - 1, i)
ans = max(ans, s[j] - s[i - 1])
print(ans) | 8 | PYTHON3 |
n,d=map(int,input().split())
a=[]
for i in range(n):
a.append([int(i) for i in input().split()])
a.sort()
money = 0 ; f = a[0][1] ; ff=[]
for i in range(1,n):
if a[i][0]<a[money][0]+d:
f+=a[i][1]
else:
ff.append(f)
while a[i][0]>=a[money][0]+d:
f-=a[money][1]
money+=1
f+=a[i][1]
ff.append(f)
print(max(ff))
| 8 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
struct s {
long long a, b;
} v[123456];
bool cmp(s a, s b) { return a.a < b.a; }
int main() {
long long n, m;
cin >> n >> m;
for (int i = 0; i < n; i++) cin >> v[i].a >> v[i].b;
sort(&v[0], &v[n], cmp);
long long mx = 0, p = 0, now = 0;
for (int i = 0; i < n; i++) {
while (v[i].a - v[p].a >= m) {
now -= v[p].b;
p++;
}
now = now + v[i].b;
mx = max(mx, now);
}
cout << mx << endl;
}
| 8 | CPP |
#include <bits/stdc++.h>
using namespace std;
int main() {
long n = 0;
long d = 0;
cin >> n;
cin >> d;
struct fr {
long money;
long friendship;
};
vector<fr> friends;
friends.reserve(n);
auto c = n;
while (c--) {
fr nf;
cin >> nf.money;
cin >> nf.friendship;
friends.push_back(nf);
}
sort(begin(friends), end(friends), [](const fr& lhs, const fr& rhs) {
if (lhs.money != rhs.money) return (lhs.money < rhs.money);
return (lhs.friendship > rhs.friendship);
});
long long sum = 0;
long long maxSum = 0;
long long minMoneyIndex = 0;
for (size_t i = 0; i < friends.size(); ++i) {
while ((friends[i].money - friends[minMoneyIndex].money) >= d) {
sum -= friends[minMoneyIndex].friendship;
++minMoneyIndex;
}
sum += friends[i].friendship;
maxSum = max(sum, maxSum);
if (sum < 0) sum = 0;
}
cout << maxSum << "\n";
};
| 8 | CPP |
def binarySearch(alist, value):
first = 0
last = len(alist)-1
while first <= last:
midpoint = (first + last)//2
if value >= alist[midpoint]["m"] and value < alist[midpoint + 1]["m"]:
return midpoint
else:
if value >= alist[midpoint+1]["m"]:
first = midpoint+1
else:
if value < alist[midpoint]["m"]:
last = midpoint-1
return 10**10
[n, d] = list(map(int, input().split(" ")))
a = []
for i in range(n):
[m, s] = list(map(int, input().split(" ")))
a.append({"m": m, "s": s})
a.sort(key=lambda x: x["m"])
a.append({"m": 10**10, "s": 0})
t = [a[0]["s"]]
for i in range(1, n+1):
t.append(t[i-1] + a[i]["s"])
m = 0
for i in range(n):
v = a[i]["m"]+d-1
e = binarySearch(a, v)
r = t[e] - (0 if i == 0 else t[i-1])
m = max(m,r)
print(m)
| 8 | PYTHON3 |
import math
s = input().split()
n, d = int(s[0]), int(s[1])
ms = []
for _ in range(n):
st = input().split()
if int(st[1]):
ms.append((int(st[0]), (int(st[1]))))
ms = sorted(ms, key=lambda i: i[0])
m, s = [], []
for i in ms:
m.append(i[0])
s.append(i[1])
ssums = [0]
for i in s:
ssums.append(ssums[-1] + i)
# ssums.append(ssums[-1])
maxsSum = 0
iOverMaxEl = 1
for iMinEl in range(len(m)):
if iOverMaxEl <= iMinEl:
iOverMaxEl = iMinEl + 1
while iOverMaxEl < len(s) and m[iOverMaxEl] - m[iMinEl] < d:
iOverMaxEl += 1
sSum = ssums[iOverMaxEl] - ssums[iMinEl]
# sSum = sum(s[iMinEl: iOverMaxEl])
if sSum > maxsSum:
maxsSum = sSum
print(maxsSum)
| 8 | PYTHON3 |
def max_friendship_factor(friends, min_money_diff):
sorted_friends = sorted(friends, key=lambda t: t[0])
n = len(friends)
_, ff_sum = sorted_friends[0] # set first elements ff to ff_sum
max_ff_sum = ff_sum # and max_ff_sum
head_index = 0
hm, hff = sorted_friends[0] # set head money and head ff
for i in range(1, n):
m, ff = sorted_friends[i]
ff_sum += ff
while abs(m - hm) >= min_money_diff:
# push head forwards
ff_sum -= hff
head_index += 1
hm, hff = sorted_friends[head_index]
if max_ff_sum < ff_sum:
max_ff_sum = ff_sum
return max_ff_sum
def run_alg():
first_line_data = input().split(' ')
num_friends = int(first_line_data[0])
min_money_diff = int(first_line_data[1])
friends = []
for _ in range(num_friends):
line_data = input().split(' ')
money = int(line_data[0])
friendship = int(line_data[1])
friends.append((money, friendship))
print(max_friendship_factor(friends, min_money_diff))
if __name__ == '__main__':
run_alg()
| 8 | PYTHON3 |
n,d=map(int,input().split())
friends=[[] for i in range(n)]
for i in range(n):
m,s=map(int,input().split())
friends[i] = [m,s]
friends.sort()
li=[0]*n
i,j=0,0
tot = 0
while i < n:
currI = friends[i]
tot += currI[1]
while currI[0] - friends[j][0] >= d:
tot -= friends[j][1]
j += 1
li[i] = tot
i += 1
print(max(li))
| 8 | PYTHON3 |
# -*- coding: utf-8 -*-
import sys
import math
import os
import itertools
import string
import heapq
import _collections
from collections import Counter
from collections import defaultdict
from functools import lru_cache
import bisect
import re
import queue
from decimal import *
class Scanner():
@staticmethod
def int():
return int(sys.stdin.readline().rstrip())
@staticmethod
def string():
return sys.stdin.readline().rstrip()
@staticmethod
def map_int():
return [int(x) for x in Scanner.string().split()]
@staticmethod
def string_list(n):
return [input() for i in range(n)]
@staticmethod
def int_list_list(n):
return [Scanner.map_int() for i in range(n)]
@staticmethod
def int_cols_list(n):
return [int(input()) for i in range(n)]
class Math():
@staticmethod
def gcd(a, b):
if b == 0:
return a
return Math.gcd(b, a % b)
@staticmethod
def lcm(a, b):
return (a * b) // Math.gcd(a, b)
@staticmethod
def divisor(n):
res = []
i = 1
for i in range(1, int(n ** 0.5) + 1):
if n % i == 0:
res.append(i)
if i != n // i:
res.append(n // i)
return res
@staticmethod
def round_up(a, b):
return -(-a // b)
@staticmethod
def is_prime(n):
if n < 2:
return False
if n == 2:
return True
if n % 2 == 0:
return False
d = int(n ** 0.5) + 1
for i in range(3, d + 1, 2):
if n % i == 0:
return False
return True
class PriorityQueue:
def __init__(self, l=[]):
self.q = l
heapq.heapify(self.q)
return
def push(self, n):
heapq.heappush(self.q, n)
return
def pop(self):
return heapq.heappop(self.q)
def pop_count(x):
x = x - ((x >> 1) & 0x5555555555555555)
x = (x & 0x3333333333333333) + ((x >> 2) & 0x3333333333333333)
x = (x + (x >> 4)) & 0x0f0f0f0f0f0f0f0f
x = x + (x >> 8)
x = x + (x >> 16)
x = x + (x >> 32)
return x & 0x0000007f
MOD = int(1e09) + 7
INF = int(1e15)
def main():
# sys.stdin = open("sample.txt")
N, D = Scanner.map_int()
M = [(0, 0) for _ in range(N)]
for i in range(N):
m, s = Scanner.map_int()
M[i] = (m, s)
M.sort()
r = 0
tmp = 0
ans = 0
for l in range(N):
while r < N and M[l][0] + D > M[r][0]:
tmp += M[r][1]
r += 1
ans = max(ans, tmp)
tmp -= M[l][1]
print(ans)
if __name__ == "__main__":
main()
| 8 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
struct prieten {
int first, second;
};
prieten a[100002];
int d;
int main() {
int n, i, j;
long long lmax = 0;
pair<int, int> a[100002];
cin >> n >> d;
for (i = 1; i <= n; i++) cin >> a[i].first >> a[i].second;
sort(a + 1, a + n + 1);
j = 1;
long long sc = 0;
for (i = 1; i <= n; i++) {
sc += a[i].second;
while (j <= i && a[i].first - a[j].first >= d) {
sc -= a[j].second;
j++;
}
lmax = max(lmax, sc);
}
cout << lmax;
return 0;
}
| 8 | CPP |
n,d=map(int, input().split())
arr=[]
for i in range(n):
arr.append(tuple(map(int, input().split())))
arr=sorted(arr)
prefix=[]
prefix.append(arr[0][1])
for i in range(1,n):
prefix.append(prefix[i-1]+arr[i][1])
ans=0
for i in range(n):
low=0
high=n-1
while low<high:
mid=(low+high+1)//2
if arr[mid][0]>=arr[i][0]+d:
high=mid-1
else:
low=mid
if i==0:
ans=prefix[low]
elif prefix[low]-prefix[i-1]>ans:
ans=prefix[low]-prefix[i-1]
print(ans) | 8 | PYTHON3 |
import sys
def fastio():
from io import StringIO
from atexit import register
global input
sys.stdin = StringIO(sys.stdin.read())
input = lambda : sys.stdin.readline().rstrip('\r\n')
sys.stdout = StringIO()
register(lambda : sys.__stdout__.write(sys.stdout.getvalue()))
fastio()
def debug(*var, sep = ' ', end = '\n'):
print(*var, file=sys.stderr, end = end, sep = sep)
INF = 10**20
MOD = 10**9 + 7
I = lambda:list(map(int,input().split()))
from math import gcd
from math import ceil
from collections import defaultdict as dd, Counter
from bisect import bisect_left as bl, bisect_right as br
n, d = I()
a = [(0, 0)]
for i in range(n):
x, y = I()
a.append((x, y))
a.sort()
j = 0
ans = 0
cur = 0
for i in range(1, n + 1):
cur += a[i][1]
while a[i][0] - a[j][0] >= d:
cur -= a[j][1]
j += 1
ans = max(ans, cur)
print(ans) | 8 | PYTHON3 |
[n, d] = map(int, input().strip().split())
a = []
for i in range(n):
[m, f] = map(int, input().strip().split())
a.append((m, f))
a.sort()
l, r = 0, 0
Sum = 0
ans = 0
while(l < n):
while(r < n and a[r][0] - a[l][0] < d):
Sum += a[r][1]
r += 1
ans = max(ans, Sum)
Sum -= a[l][1]
l += 1
print(ans)
| 8 | PYTHON3 |
"Codeforces Round #260 (Div. 1)"
"A. Boredom"
# def Boredom():
# y=int(input())
# a=list(map(int,input().split()))
# d={}
# for i in a:
# d.setdefault(i,0)
# d[i]+=1
# # print(d)
# k=list(d.keys())
# k.sort()
# # print(k)
# l=len(k)
# k.append(0)
# d[0]=0
# sum=0
# if l==1:
# print(k[0]*d[k[0]])
# return
# z=x=0
# za=0
# for i in range(l):
# # print(sum,z,x,k[i])
# z+=(1-za)*d[k[i]]*k[i]
# x+=za*(d[k[i]])*k[i]
# za=1-za
# if k[i]+1!=k[i+1]:
# sum+=max(z,x)
# z=x=0
# print(sum)
# return
# Boredom()
"Codeforces Round #321 (Div. 2)"
"B. Kefa and Company"
def Kefa_and_Company():
n,dd=map(int,input().split())
d={}
for i in range(n):
z,x=map(int,input().split())
d.setdefault(z,0)
d[z]+=x
m=list(d.keys())
m.sort()
f=[0]
for i in m:
f.append(f[-1]+d[i])
f.pop(0)
# print(m)
# print(f)
i=j=0
ans=[]
l=len(m)
while True:
# print(i,j,m[i],m[j],ans)
if m[j]-m[i]>=dd:
if i==0:
ans.append(f[j-1])
# elif j==l-1:
# if m[j]-m[i-1]>dd:
# ans.append(f[j]-f[i-1])
# else
else:
ans.append(f[j-1]-f[i-1])
i+=1
else:
if j==l-1:
if i==0:
ans.append(f[j])
elif i==l-1:
ans.append(f[j]-f[i-1])
else:
ans.append(f[j]-f[i-1])
break
j+=1
ws=max(ans)
print(ws)
return
Kefa_and_Company() | 8 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
struct Friend {
long long money, factor;
};
long long d;
vector<Friend> friends;
bool hasInferiorityFeelings(int i, int k) {
if (k == 0) {
return false;
}
return friends[i + k - 1].money - friends[i].money >= d;
}
int main() {
int n;
cin >> n >> d;
friends.resize(n);
for (Friend &f : friends) {
cin >> f.money >> f.factor;
}
sort(friends.begin(), friends.end(),
[](Friend a, Friend b) { return a.money < b.money; });
vector<long long> partialSums(n + 1, 0);
for (int i = 0; i < n; i++) {
partialSums[i + 1] = partialSums[i] + friends[i].factor;
}
long long maxFriendship = 0;
for (int i = 0; i < n; i++) {
int l = 0, r = n - i;
while (l != r) {
int m = (l + r + 1) / 2;
if (!hasInferiorityFeelings(i, m)) {
l = m;
} else {
r = m - 1;
}
}
long long totalFriendship = partialSums[i + r] - partialSums[i];
maxFriendship = max(maxFriendship, totalFriendship);
}
cout << maxFriendship << '\n';
}
| 8 | CPP |
from collections import namedtuple
Friend = namedtuple("Friend", "money value")
n, d = map(int, input().split())
# At first we sort all friends in money ascending order.
arr = []
for i in range(n):
money, value = map(int, input().split())
arr.append(Friend(money, value))
arr.sort()
sss = arr[0].value # the answer is some sub segment sum of the array
ans = sss
# Next, we use the method of two pointers for finding the required subsegment.
tail = 0
for head in range(1, n): # range increases head
while (arr[head].money - arr[tail].money >= d): # while drags tail as necessary
sss -= arr[tail].value
tail += 1
sss += arr[head].value
ans = max(sss, ans)
print(ans)
| 8 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
vector<pair<int, int> > v;
int main() {
int n, d, x, y;
scanf("%d %d", &n, &d);
for (int i = 0, _ = n; i < n; i++) {
scanf("%d %d", &x, &y);
v.push_back(make_pair(x, y));
}
sort(v.begin(), v.end());
long long maxi = 0, sum = 0;
int i = 0, curr = 0;
for (int i = 0, _ = n; i < n; i++) {
sum += v[i].second;
while (v[i].first - v[curr].first >= d) {
sum -= v[curr].second;
curr++;
}
maxi = max(sum, maxi);
}
printf("%lld\n", maxi);
return 0;
}
| 8 | CPP |
class Dupla:
def __init__(self, money, factor):
self.money = money
self.factor = factor
def getMoney(self):
return self.money
def getFactor(self):
return self.factor
def __repr__(self):
return ' - '.join(map(str,(self.money,self.factor)))
def __lt__(self, other):
return self.money < other.money
a = []
n, d = map(int, input().split())
for i in range(n):
m, f = map(int, input().split())
t = Dupla(m, f)
a.append(t)
s = sorted(a)
maxi1 = s[0].getFactor()
maxi2 = s[0].getFactor()
i = 1
j = 0
while(i < n):
if(abs(s[j].getMoney() - s[i].getMoney()) < d):
maxi1 += s[i].getFactor()
i += 1
if(maxi1 > maxi2):
maxi2 = maxi1
else:
maxi1 -= s[j].getFactor()
j += 1
print(maxi2) | 8 | PYTHON3 |
from collections import Counter
f = lambda: map(int, input().split())
n, d = f()
friends = []
for i in range(n):
friends.append(tuple(f()))
friends.sort(key=lambda x: x[0])
max_s = 0
temp_s = friends[0][1]
l, r = 0, 0
while l < n and r < n:
if temp_s > max_s:
max_s = temp_s
if r + 1 < n and friends[l][0] + d > friends[r + 1][0]:
r += 1
temp_s += friends[r][1]
elif l == r and r + 1 < n:
l += 1
r += 1
temp_s = friends[l][1]
else:
l += 1
temp_s -= friends[l - 1][1]
print(max_s)
| 8 | PYTHON3 |
n, d = map(int, input().split())
friends = sorted(tuple(map(int, input().split())) for _ in range(n))
left = sub_sum = max_sum = 0
for right in range(n):
sub_sum += friends[right][1]
while friends[right][0] - friends[left][0] >= d:
sub_sum, left = sub_sum - friends[left][1], left + 1
max_sum = max(sub_sum, max_sum)
print(max_sum) | 8 | PYTHON3 |
l = list(map(int, input().rstrip().split()))
a=[]
for i in range(l[0]):
k = list(map(int, input().rstrip().split()))
a.append(k)
a.sort()
end=0
strat=0
trust=0
subtrust=0
k=0
while(end<len(a)):
if abs(a[strat][0]-a[end][0])<l[1]:
subtrust+=a[end][1]
end += 1
trust=max(trust,subtrust)
else:
subtrust -= a[strat][1]
strat+=1
print(trust)
| 8 | PYTHON3 |
from sys import stdin,stdout
n,d=map(int,input().split())
l=[]
for i in range(n):
l.append(list(map(int,stdin.readline().split())))
l.sort()
from bisect import bisect_left
ans=0
l1=[0]
f=0
for i in l:
f+=i[1]
l1.append(f)
for i in range(1,n+1):
x=bisect_left(l,[l[i-1][0]+d,0])
ans=max(ans,l1[x]-l1[i-1])
print(ans)
| 8 | PYTHON3 |
import sys
from bisect import bisect_right
from itertools import accumulate
def main():
n, d = map(int, input().split())
friends = sorted(tuple(int(c) for c in line.split()) for line in sys.stdin)
money = [e[0] for e in friends]
friendship_sum = [0] + list(accumulate(e for _, e in friends))
start = 0
_min, ans = friends[0]
for i in range(1, n):
cur = friends[i][0]
if cur - _min >= d:
start = bisect_right(money, cur - d)
_min = friends[start][0]
friendship = friendship_sum[i + 1] - friendship_sum[start]
ans = max(ans, friendship)
print(ans)
if __name__ == "__main__":
main()
| 8 | PYTHON3 |
a,b=map(int,input().split())
x=[[0,0]]
mx=0
c1=1
c2=1
for i in range(a):
x.append(list(map(int,input().split())))
x.sort()
for i in range(1,a+1):
x[i][1]=x[i-1][1]+x[i][1]
for c1 in range(0,a+1):
c2=max(c1,c2)
while c2<a+1 and x[c2][0]<x[c1][0]+b:
c2+=1
mx=max(mx,x[c2-1][1]-x[c1-1][1])
if mx==19:
print(c2,c1)
print(mx)
| 8 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
;
long long int t, n, i, d, x, y, st = 0, e = 0;
long long int sum = 0, ans = 0;
cin >> n >> d;
vector<pair<long long int, long long int> > v;
for (i = 0; i < n; i++) {
cin >> x >> y;
v.push_back({x, y});
}
sort(v.begin(), v.end());
while (e < n) {
if (v[e].first - v[st].first < d)
sum += v[e].second, e++;
else if (st < e)
sum -= v[st].second, st++;
ans = max(ans, sum);
}
cout << ans << endl;
}
| 8 | CPP |
# print ("Input digits and base for number one")
n1, b1 = (int(x) for x in input().split())
# print ("Input all the digits")
d1 = list(int(x) for x in input().split())
d1.reverse()
# print ("Input digits and base for number two")
n2, b2 = (int(x) for x in input().split())
# print ("Input all the digits")
d2 = list(int(x) for x in input().split())
d2.reverse()
# Compute base ten representation of number one
answer1 = 0
power1 = 1
for digit in d1:
answer1 += digit*power1
power1 *= b1
# print(answer1)
# Compute base ten representation of number two
answer2 = 0
power2 = 1
for digit in d2:
answer2 += digit*power2
power2 *= b2
# print(answer2)
if answer1 < answer2:
print("<")
elif answer2 < answer1:
print(">")
else:
print("=")
| 7 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, bn;
cin >> n >> bn;
long long int sum = 0;
while (n--) {
int a;
cin >> a;
sum = (long long int)bn * sum + a;
}
long long int sum1 = 0;
int m, bm;
cin >> m >> bm;
while (m--) {
int a;
cin >> a;
sum1 = (long long int)bm * sum1 + a;
}
if (sum > sum1)
cout << '>';
else if (sum < sum1)
cout << '<';
else
cout << '=';
}
| 7 | CPP |
digit1, base1 = input().split()
data = input().split()
data = [int(x) for x in data]
data = data[::-1]
out = 0
power = 0
for i in data:
out += i * (int(base1) ** power)
power += 1
digit2, base2 = input().split()
data2 = input().split()
data2 = [int(x) for x in data2]
data2 = data2[::-1]
power = 0
out2 = 0
for i in data2:
out2 += i * (int(base2) ** power)
power += 1
if out == out2:
print('=')
elif out < out2:
print('<')
elif out > out2:
print('>')
| 7 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
const int N = 200010;
long long i, j, n, m, k, a[N], s, r, ss;
int main() {
cin >> n >> m;
for (i = 0; i < n; i++) cin >> a[i];
s = 0, r = 1;
for (i = n - 1; i >= 0; i--, r *= m) s = s + r * a[i];
cin >> n >> m;
for (i = 0; i < n; i++) cin >> a[i];
ss = 0, r = 1;
for (i = n - 1; i >= 0; i--, r *= m) ss = ss + r * a[i];
if (ss < s)
cout << '>';
else if (ss > s)
cout << '<';
else
cout << '=';
return 0;
}
| 7 | CPP |
print((lambda x:'>' if x>0 else '='if x==0 else '<')(sum((lambda n:map((lambda x: n[1]**x[0]*x[1]),(list(enumerate(reversed(list(map(int,input().split()))))))))(list(map(int,input().split()))))-sum((lambda bx:map((lambda x: bx[1]**x[0]*x[1]),(list(enumerate(reversed(list(map(int,input().split()))))))))(list(map(int,input().split()))))))
| 7 | PYTHON3 |
#!/usr/bin/env python3
def to_int(digits, base):
r = 0
for d in digits:
r = r*base + d
return r
if __name__ == '__main__':
n, bx = map(int, input().split())
x = to_int(list(map(int, input().split())), bx)
m, by = map(int, input().split())
y = to_int(list(map(int, input().split())), by)
if x == y:
print('=')
elif x < y:
print('<')
else:
print('>')
| 7 | PYTHON3 |
"""
Codeforces Round 333 (Div. 2)
Problem 602 A.
@author yamaton
@date 2015-11-24
"""
import itertools as it
import functools
import operator
import collections
import math
import sys
def solve(xs, ys, bx, by):
x = functools.reduce(lambda acc, x: acc * bx + x, xs)
y = functools.reduce(lambda acc, y: acc * by + y, ys)
if x < y:
return '<'
elif x > y:
return '>'
else:
return '='
# def p(*args, **kwargs):
# return print(*args, file=sys.stderr, **kwargs)
def main():
[n, bx] = map(int, input().strip().split())
xs = [int(c) for c in input().strip().split()]
assert len(xs) == n
[m, by] = map(int, input().strip().split())
ys = [int(c) for c in input().strip().split()]
assert len(ys) == m
result = solve(xs, ys, bx, by)
print(result)
if __name__ == '__main__':
main()
| 7 | PYTHON3 |
__author__ = 'cmashinho'
n, b = map(int, input().split())
lB = list(map(int, input().split()))
m, y = map(int, input().split())
lY = list(map(int, input().split()))
nB = 0
nY = 0
for i in range(n):
nB += lB[i] * int(pow(b, (n - i - 1)))
for i in range(m):
nY += lY[i] * int(pow(y, (m - i - 1)))
if nB == nY:
print("=")
elif nB > nY:
print(">")
else:
print("<")
| 7 | PYTHON3 |
#include <bits/stdc++.h>
long long pow(long long x, long long y) {
long long n = 1;
while (y--) n *= x;
return n;
}
int main() {
long long ans = 0, n, b, a;
scanf("%lld%lld", &n, &b);
for (long long i = 0; i < n; i++) {
scanf("%lld", &a);
ans += a * pow(b, n - i - 1);
}
scanf("%lld%lld", &n, &b);
for (long long i = 0; i < n; i++) {
scanf("%lld", &a);
ans -= a * pow(b, n - i - 1);
}
if (!ans)
printf("=\n");
else if (ans < 0)
printf("<\n");
else
printf(">\n");
return 0;
}
| 7 | CPP |
#include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
long long x = 0, y = 0;
int n, m, bx, by;
cin >> n >> bx;
for (int i = 0; i < (int)(n); i++) {
int a;
cin >> a;
x = x * bx + a;
}
cin >> m >> by;
for (int i = 0; i < (int)(m); i++) {
int a;
cin >> a;
y = y * by + a;
}
if (x == y)
cout << '=';
else if (x > y)
cout << '>';
else
cout << '<';
cout << endl;
return 0;
}
| 7 | CPP |
#include <bits/stdc++.h>
using namespace std;
const int INF = 1 << 29;
const double EPS = 1e-10;
double zero(double d) { return d < EPS ? 0.0 : d; }
template <typename T1, typename T2>
ostream &operator<<(ostream &os, const pair<T1, T2> &p) {
return os << '(' << p.first << ',' << p.second << ')';
}
template <typename T>
ostream &operator<<(ostream &os, const vector<T> &a) {
os << '[';
for (int i = 0; i < (int)(a.size()); i++) os << (i ? " " : "") << a[i];
return os << ']';
}
string toString(int i) {
stringstream ss;
ss << i;
return ss.str();
}
const int MOD = 1000000007;
long long fpow(long long a, long long k, int M) {
long long res = 1ll;
long long x = a;
while (k != 0) {
if ((k & 1) == 1) res = (res * x) % M;
x = (x * x) % M;
k >>= 1;
}
return res;
}
int main() {
cout.setf(ios::fixed, ios::floatfield);
cout.precision(8);
ios_base::sync_with_stdio(false);
int n, bx;
cin >> n >> bx;
vector<int> a(n);
for (int i = 0; i < (int)(n); i++) cin >> a[i];
int m, by;
cin >> m >> by;
vector<int> b(m);
for (int i = 0; i < (int)(m); i++) cin >> b[i];
long long ans1 = 0, ans2 = 0;
for (int i = 0; i < (int)(n); i++) {
ans1 = ans1 * bx + a[i];
}
for (int i = 0; i < (int)(m); i++) {
ans2 = ans2 * by + b[i];
}
if (ans1 == ans2)
cout << "=" << endl;
else if (ans1 < ans2)
cout << "<" << endl;
else
cout << ">" << endl;
return 0;
}
| 7 | CPP |
n1, b1 = map(int, input().split())
ans1 = 0
a1 = list(map(int, input().split()))
n2, b2 = map(int, input().split())
ans2 = 0
a2 = list(map(int, input().split()))
for i in range(n1):
ans1 += a1[i] * (b1 ** (n1 - i - 1))
for i in range(n2):
ans2 += a2[i] * (b2 ** (n2 - i - 1))
if (ans1 == ans2):
print('=')
else:
if ans1 > ans2:
print('>')
else:
print('<')
| 7 | PYTHON3 |
# Description of the problem can be found at http://codeforces.com/problemset/problem/602/A
def calc():
n, b = map(int, input().split())
x =list(map(int, input().split()))
a = 0
for i in x:
a = a * b + i
return a
l_n = list()
for _ in range(2):
l_n.append(calc())
if l_n[0] < l_n[1]:
print("<")
elif l_n[1] < l_n[0]:
print(">")
else:
print("=") | 7 | PYTHON3 |
nx,bx = map(int,input().split())
ar_x = list(map(int,input().split()))
ny,by = map(int,input().split())
ar_y = list(map(int,input().split()))
ans_y,ans_x = 0,0
cnt = 0
for i in ar_y[::-1]:
ans_y = ans_y+i*(by**cnt)
cnt+=1
cnt =0
for i in ar_x[::-1]:
ans_x = ans_x+i*(bx**cnt)
cnt+=1
if ans_x == ans_y:
print("=")
elif ans_x < ans_y:
print("<")
else:
print(">") | 7 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
const int MAXN = 20;
int n, m;
long long bn, bm, l1 = 1, l2 = 1, ans1, ans2;
long long arr1[MAXN], arr2[MAXN];
int main() {
cin >> n >> bn;
for (int i = 0; i < n; i++) cin >> arr1[i];
for (int i = n - 1; i >= 0; i--) ans1 += l1 * arr1[i], l1 *= bn;
cin >> m >> bm;
for (int i = 0; i < m; i++) cin >> arr2[i];
for (int i = m - 1; i >= 0; i--) ans2 += l2 * arr2[i], l2 *= bm;
;
if (ans1 < ans2) cout << "<";
if (ans1 == ans2) cout << "=";
if (ans1 > ans2) cout << ">";
return 0;
}
| 7 | CPP |
#include <bits/stdc++.h>
using namespace std;
long long Read() {
int n, b;
scanf("%d%d", &n, &b);
long long x = 0;
for (int i = 0; i < n; ++i) {
int y;
scanf("%d", &y);
x = x * b + y;
}
return x;
}
int main() {
long long x = Read();
long long y = Read();
if (x == y)
printf("=\n");
else if (x < y)
printf("<\n");
else
printf(">\n");
return 0;
}
| 7 | CPP |
#include <bits/stdc++.h>
using namespace std;
int main() {
int nx, ny, bx, by;
long long x = 0, y = 0;
cin >> nx >> bx;
long long o = 1;
for (int i = 1; i < nx; i++) {
o *= bx;
}
for (int i = nx - 1; i >= 0; i--) {
int l;
cin >> l;
x += l * o;
o /= bx;
}
cin >> ny >> by;
o = 1;
for (int i = 1; i < ny; i++) {
o *= by;
}
for (int i = ny - 1; i >= 0; i--) {
int l;
cin >> l;
y += l * o;
o /= by;
}
if (x < y) {
cout << "<";
} else if (x > y) {
cout << ">";
} else {
cout << "=";
}
return 0;
}
| 7 | CPP |
read = lambda: map(int, input().split())
t, bx = read()
X = list(read())
x = sum(X[_] * bx ** (t - 1 - _) for _ in range(t))
t, by = read()
Y = list(read())
y = sum(Y[_] * by ** (t - 1 - _) for _ in range(t))
print('<' if x < y else '>' if x > y else '=')
| 7 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
long long int a, b, n, m;
long long int K[100000];
int main() {
scanf("%lld %lld", &n, &m);
long long int s1 = 1, x = 0, y = 0;
for (int i = 1; i <= n; i++) scanf("%lld", &K[i]);
for (int i = 1; i <= n; i++) {
x += K[n - i + 1] * s1;
s1 *= m;
}
s1 = 1;
scanf("%lld %lld", &a, &b);
for (int i = 1; i <= a; i++) scanf("%lld", &K[i]);
for (int i = 1; i <= a; i++) {
y += K[a - i + 1] * s1;
s1 *= b;
}
if (x == y) printf("=");
if (x > y) printf(">");
if (x < y) printf("<");
}
| 7 | CPP |
#include <bits/stdc++.h>
using namespace std;
int main() {
long long X = 0, Y = 0, n, bx, by, xi, yi;
cin >> n >> bx;
for (int i = 0; i < n; i++) {
cin >> xi;
X = X * bx + xi;
}
cin >> n >> by;
for (int i = 0; i < n; i++) {
cin >> yi;
Y = Y * by + yi;
}
if (X > Y) {
cout << ">" << endl;
} else if (X < Y) {
cout << "<" << endl;
} else {
cout << "=" << endl;
}
return 0;
}
| 7 | CPP |
#include <bits/stdc++.h>
using namespace std;
long long power(long long n, long long p);
int main() {
long long n, bx, m, by, x = 0, x1, y = 0, y1;
cin >> n >> bx;
for (long long i = n - 1; i >= 0; i--) {
cin >> x1;
x = x + x1 * power(bx, i);
}
cin >> m >> by;
for (long long j = m - 1; j >= 0; j--) {
cin >> y1;
y = y + y1 * power(by, j);
}
if (x > y)
cout << ">" << '\n';
else if (x < y)
cout << "<" << '\n';
else
cout << "=" << '\n';
return 0;
}
long long power(long long n, long long p) {
if (p == 0)
return 1;
else
return n * power(n, p - 1);
}
| 7 | CPP |
#include <bits/stdc++.h>
using namespace std;
const int maxn = 1005;
const long long inf = 1LL << 45;
const long long mod = 1e9 + 7;
int n, k;
int a[maxn];
long long num() {
long long ans = 0;
for (int i = 0; i < n; i++) {
ans = ans * k + a[i];
}
return ans;
}
int main() {
scanf("%d%d", &n, &k);
for (int i = 0; i < n; i++) {
scanf("%d", &a[i]);
}
long long aa = num();
scanf("%d%d", &n, &k);
for (int i = 0; i < n; i++) {
scanf("%d", &a[i]);
}
long long bb = num();
if (aa == bb) {
printf("=\n");
} else if (aa > bb) {
puts(">");
} else {
puts("<");
}
return 0;
}
| 7 | CPP |
#include <bits/stdc++.h>
using namespace std;
long long x = 0, y = 0, n, b, cur, pre;
void get(long long &a) {
scanf("%lld%lld", &n, &b);
for (int i = 0; i < n; ++i) scanf("%lld", &pre), a = a * b + pre;
}
int main() {
get(x), get(y);
printf("%c\n", (x > y) ? '>' : ((x == y) ? '=' : '<'));
return 0;
}
| 7 | CPP |
import math
n,b1=map(int,input().split())
l1=list(map(int,input().split()))
x=0
y=0
m,b2=map(int,input().split())
l2=list(map(int,input().split()))
for i in range(0,n):
x=x+l1[i]*math.pow(b1,n-i-1);
for i in range(0,m):
y=y+l2[i]*math.pow(b2,m-i-1);
if(x==y):
print("=")
elif(x<y):
print("<")
else:
print(">")
| 7 | PYTHON3 |
s1=input().split()
n=int(s1[0])
m=int(s1[1])
s=list(map(int,input().split()))
s2=input().split()
z=int(s2[0])
x=int(s2[1])
d=list(map(int,input().split()))
k=0
j=0
s.reverse()
d.reverse()
kk=0
jj=0
for i in range(n):
k+=(m**kk)*s[i]
kk+=1
for i in range(z):
j+=(x**jj)*d[i]
jj+=1
if k>j:
print(">")
elif k<j:
print("<")
else:
print("=")
| 7 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
unsigned long long pow(int a, int b) {
unsigned long long w = 1;
for (int i = 1; i <= b; i++) w *= (unsigned long long)a;
return w;
}
int main() {
unsigned long long w1 = 0, w2 = 0;
int n, b;
scanf("%d%d", &n, &b);
unsigned long long w = pow(b, n - 1);
for (int i = 0; i < n; i++) {
int a;
scanf("%d", &a);
w1 += (unsigned long long)a * w;
w /= b;
}
scanf("%d%d", &n, &b);
w = pow(b, n - 1);
for (int i = 0; i < n; i++) {
int a;
scanf("%d", &a);
w2 += (unsigned long long)a * w;
w /= b;
}
if (w1 < w2)
printf("<\n");
else if (w1 > w2)
printf(">\n");
else
printf("=\n");
return 0;
}
| 7 | CPP |
n1,base1 = list(map(int, input().strip(" ").split(" ")))
x = list(map(int, input().strip(" ").split(" ")))
n2,base2 = list(map(int, input().strip(" ").split(" ")))
y = list(map(int, input().strip(" ").split(" ")))
def basex_base10(x,n,base):
ans = 0
for i in range(n):
ans = ans + x[i]*(base**(n-i-1))
return ans
if basex_base10(x,n1,base1)>basex_base10(y,n2,base2):
print(">")
elif basex_base10(x,n1,base1)<basex_base10(y,n2,base2):
print("<")
else:
print("=") | 7 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, b;
cin >> n >> b;
long long c1 = 0;
vector<int> a(n);
for (int register i = 0; i < n; i++) {
cin >> a[i];
}
reverse(a.begin(), a.end());
long long c = 0;
for (int register i = 0; i < n; i++) {
c1 += a[i] * powl(b, c++);
}
long long c2 = 0;
cin >> n >> b;
vector<int> aa(n);
for (int register i = 0; i < n; i++) {
cin >> aa[i];
}
reverse(aa.begin(), aa.end());
c = 0;
for (int register i = 0; i < n; i++) {
int t = a[i];
c2 += aa[i] * powl(b, c++);
}
if (c1 == c2) {
cout << "=";
} else if (c1 < c2)
cout << "<";
else
cout << ">";
cout << '\n';
return 0;
}
| 7 | CPP |
n,b=map(int,input().split())
l=list(map(int,input().split()))
d=1
a1=b1=0
for x in range(n-1,-1,-1):
a1+=l[x]*d
d*=b
m,a=map(int,input().split())
l=list(map(int,input().split()))
d=1
for x in range(m-1,-1,-1):
b1+=l[x]*d
d*=a
if a1==b1:print('=')
elif a1>b1:print('>')
else:print('<') | 7 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
int largerOne(long long sumX, long long sumY, int xi, int yi, long long powerX,
long long powerY) {
if (xi * powerX + sumX > (yi + 1) * powerY + sumY)
return 1;
else if (yi * powerY + sumY > (xi + 1) * powerX + sumX)
return 2;
else
return 0;
}
int main() {
int n, m, bx, by;
vector<int> X, Y;
long long powerX = 1, powerY = 1;
bool xLarger = false, yLarger = false;
istream &input = cin;
input >> n >> bx;
for (int i = 0; i < n; i++) {
int a;
input >> a;
X.push_back(a);
powerX *= bx;
}
powerX /= bx;
input >> m >> by;
for (int i = 0; i < m; i++) {
int a;
input >> a;
Y.push_back(a);
powerY *= by;
}
powerY /= by;
int l = min(n, m);
long long sumX = 0, sumY = 0;
for (int i = 0; i < l; i++) {
int xi = X[i], yi = Y[i];
int res = largerOne(sumX, sumY, xi, yi, powerX, powerY);
if (res == 0) {
sumX += powerX * xi;
sumY += powerY * yi;
powerX /= bx, powerY /= by;
} else if (res == 1) {
xLarger = true;
break;
} else if (res == 2) {
yLarger = true;
break;
} else {
assert(false);
}
}
if (xLarger) {
cout << '>' << endl;
return 0;
} else if (yLarger) {
cout << '<' << endl;
return 0;
} else if (n == m) {
if (sumX > sumY)
cout << '>' << endl;
else if (sumX < sumY)
cout << '<' << endl;
else
cout << '=' << endl;
return 0;
}
vector<int> &Z = n > m ? X : Y;
long long sumZ = n > m ? sumX : sumY;
long long sumShort = n > m ? sumY : sumX;
long long powerZ = n > m ? powerX : powerY;
long long bz = n > m ? bx : by;
bool larger = false;
for (int i = l; i < max(n, m); i++) {
int zi = Z[i];
sumZ += zi * powerZ;
if (sumZ > sumShort) {
larger = true;
break;
}
powerZ /= bz;
}
if (larger) {
cout << (n > m ? '>' : '<') << endl;
} else {
if (sumZ > sumShort) cout << '>' << endl;
if (sumZ == sumShort)
cout << '=' << endl;
else if (sumZ < sumShort)
cout << (n > m ? '<' : '>') << endl;
else
assert(false);
}
return 0;
}
| 7 | CPP |
b=[int(i) for i in input().split(' ')]
X=sum(int(j)*(b[1]**i) for i, j in zip(range(b[0]),input().split(' ')[::-1]))
b=[int(i) for i in input().split(' ')]
Y=sum(int(j)*(b[1]**i) for i, j in zip(range(b[0]),input().split(' ')[::-1]))
if X>Y:
print('>')
if X<Y:
print('<')
if X==Y:
print('=')
| 7 | PYTHON3 |
import sys
class Scanner:
def __init__(self):
self.current_tokens = []
def remaining_tokens(self):
return len(self.current_tokens)
def nextline(self):
assert self.remaining_tokens() == 0, "Reading next line with remaining tokens"
return input()
def nexttokens(self):
return self.nextline().split()
def nexttoken(self):
if len(self.current_tokens) == 0:
self.current_tokens = self.nexttokens()
assert self.remaining_tokens() > 0, "Not enough tokens to parse."
return self.current_tokens.pop(0)
def nextints(self, n=-1):
if n == -1:
return list(map(int, self.nexttokens()))
else:
return [self.nextint() for i in range(n)]
def nextint(self):
return int(self.nexttoken())
def quit():
sys.exit(0)
stdin = Scanner()
nextint = stdin.nextint
nextints = stdin.nextints
nextline = stdin.nextline
N, BX = nextints()
X = 0
for p in range(N):
X *= BX
X += nextint()
N, BY = nextints()
Y = 0
for p in range(N):
Y *= BY
Y += nextint()
if X < Y:
print("<")
elif X > Y:
print(">")
else:
print("=")
| 7 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
long long a[15], b[15];
int main() {
int ja, jb;
int la, lb;
long long num1 = 0, num2 = 0;
cin >> la >> ja;
for (int i = 0; i < la; i++) {
int t;
cin >> t;
num1 = num1 * ja + t;
}
cin >> lb >> jb;
for (int i = 0; i < lb; i++) {
int t;
cin >> t;
num2 = num2 * jb + t;
}
if (num1 < num2)
cout << '<';
else if (num1 > num2)
cout << '>';
else
cout << '=';
return 0;
}
| 7 | CPP |
#include <bits/stdc++.h>
using namespace std;
int main() {
long long int x = 0, y = 0;
long long int n, bx;
cin >> n >> bx;
long long int arr1[n];
for (long long int i = 0; i < n; i++) cin >> arr1[i];
long long int m, by;
cin >> m >> by;
long long int arr2[m];
for (long long int j = 0; j < m; j++) cin >> arr2[j];
long long int start = 0;
for (long long int i = n - 1; i >= 0; i--) {
long long int temp = round(pow(bx, i));
x += arr1[start] * temp;
start++;
}
long long int start1 = 0;
for (long long int i = m - 1; i >= 0; i--) {
long long int temp = round(pow(by, i));
y += arr2[start1] * temp;
start1++;
}
if (x == y)
cout << "=" << endl;
else if (x > y)
cout << ">" << endl;
else
cout << "<" << endl;
return 0;
}
| 7 | CPP |
Subsets and Splits
No saved queries yet
Save your SQL queries to embed, download, and access them later. Queries will appear here once saved.