题目来源:码蹄集
题目描述:
C++代码实现:
参考链接:https://yxsmarter.blog.csdn.net/article/details/128211350?spm=1001.2014.3001.5502
#include <cstdio>
#include <algorithm>
using namespace std;
int n, m;
struct chj {
int c, e;
bool operator <(const chj b)const {
return e < b.e;
}
} a[2000005];
int main() {
scanf("%d%d", &n, &m);
n += m;
for (int i = 1; i <= n; i++) {
scanf("%d%d", &a[i].c, &a[i].e);
}
sort(a + 1, a + n + 1);
int i = 1;
while (i <= n) {
int j = i + 1;
while (a[i].e == a[j].e) {
a[i].c += a[j].c;
j++;
}
if (a[i].c != 0) {
printf("%d %d\n", a[i].c, a[i].e);
}
i = j;
}
return 0;
}
参考B站老师:https://www.bilibili.com/video/BV1Ua4y1V7qX/?t=2708.0&vd_source=3ae2a916df1bc5c1114c2bf3e95a2118
#include <bits/stdc++.h>
using namespace std;
#define ll long long
const int N = 2e6 + 7;
struct NODE {
ll nex, coef, expn;
} node[N];
int n, m, head, tail, pos;
ll coefA[N], expnA[N], coefB[N], expnB[N];
void insert(int curr, ll val1, ll val2) {
node[++pos].coef = val1;
node[pos].expn = val2;
node[pos].nex = node[curr].nex;
node[curr].nex = pos;
if (!node[pos].nex)
tail = pos;
}
int main() {
scanf("%d%d", &n, &m);
for (int i = 1; i <= n; i++)
scanf("%lld%lld", &coefA[i], &expnA[i]);
for (int i = 1; i <= m; i++)
scanf("%lld%lld", &coefB[i], &expnB[i]);
int l = 1, r = 1;
while (l <= n && r <= m) {
if (expnA[l] == expnB[r]) {
insert(tail, coefA[l] + coefB[r], expnA[l]);
l++, r++;
} else {
if (expnA[l] < expnB[r]) {
insert(tail, coefA[l], expnA[l]);
l++;
} else {
insert(tail, coefB[r], expnB[r]);
r++;
}
}
}
while (l <= n) {
insert(tail, coefA[l], expnA[l]);
l++;
}
while (r <= m) {
insert(tail, coefB[r], expnB[r]);
r++;
}
// output result
for (int i = node[head].nex; i != 0; i = node[i].nex)
if (node[i].coef != 0)
printf("%lld %lld\n", node[i].coef,node[i].expn);
return 0;
}
Python代码实现(会超内存):
import sys
n, m = map(int, sys.stdin.readline().split())
n += m
a = [(0, 0)] * n
for i in range(n):
c, e = map(int, sys.stdin.readline().split())
a[i] = (c, e)
a.sort(key=lambda x: x[1])
i = 0
while i < n:
j = i + 1
while j < n and a[i][1] == a[j][1]:
a[i] = (a[i][0] + a[j][0], a[i][1])
j += 1
if a[i][0] != 0:
print(a[i][0], a[i][1])
i = j
Java代码实现(会超时):
import java.io.*;
import java.util.*;
class Main {
static class chj implements Comparable<chj> {
int c, e;
public chj(int c, int e) {
this.c = c;
this.e = e;
}
@Override
public int compareTo(chj o) {
return Integer.compare(this.e, o.e);
}
}
public static void main(String[] args) throws IOException {
BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
String[] input = br.readLine().split(" ");
int n = Integer.parseInt(input[0]);
int m = Integer.parseInt(input[1]);
n += m;
int[][] a = new int[n][2];
for (int i = 0; i < n; i++) {
input = br.readLine().split(" ");
a[i][0] = Integer.parseInt(input[0]);
a[i][1] = Integer.parseInt(input[1]);
}
Arrays.sort(a, Comparator.comparingInt(x -> x[1]));
int i = 0;
while (i < n) {
int j = i + 1;
while (j < n && a[i][1] == a[j][1]) {
a[i][0] += a[j][0];
j++;
}
if (a[i][0] != 0) {
System.out.println(a[i][0] + " " + a[i][1]);
}
i = j;
}
}
}