package AdvancedLevelPractice;
import java.util.Scanner;
public class pat1002 {
public static void main(String[] args) {
// TODO Auto-generated method stub
int max = 1001;
double[] coefficients = new double[max];
int exp, kk;
double coef;
try {
Scanner s=new Scanner(System.in);
int k = s.nextInt();
for(int i = 0; i < k; i++){
exp = s.nextInt();
coef = s.nextDouble();
coefficients[exp] = coef;
}
kk = k;
k = s.nextInt();
for(int i = 0; i < k; i++){
exp = s.nextInt();
coef = s.nextDouble();
if(coefficients[exp] != 0){
coefficients[exp] += coef;
if (coefficients[exp] == 0) {
kk--;
}
}
else {
coefficients[exp] = coef;
kk++;
}
}
System.out.print(kk);
if(kk != 0){
System.out.print(" ");
}
for(int i = max - 1; i >= 0; i--){
//System.out.println(i);
if(coefficients[i] != 0){
if(kk != 1){
System.out.print(i+" ");
System.out.print(String.format("%.1f", coefficients[i])+" ");
kk--;
}
else {
System.out.print(i+" ");
System.out.print(String.format("%.1f", coefficients[i]));
}
}
}
s.close();
} catch (Exception e) {
// TODO: handle exception
e.printStackTrace();
}
}
}
pat1002
最新推荐文章于 2022-09-05 21:41:42 发布