AcWing 5735. 兰州牛肉面
原题链接
简单
作者:
黑色礼服
,
2025-04-16 19:37:15
· 湖北
,
所有人可见
,
阅读 2
#include <iostream>
#include <cmath>
#include <vector>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> price(N);
for (int i = 0; i < N; ++i) {
double p;
cin >> p;
price[i] = round(p * 100);
}
vector<int> count(N, 0);
long long total_sum = 0;
int k, m;
while (cin >> k >> m && k != 0) {
count[k - 1] += m;
total_sum += price[k - 1] * m;
}
for (int i = 0; i < N; ++i) {
cout << count[i] << endl;
}
printf("%.2f\n", total_sum / 100.0);
return 0;
}