-

Author: liuchuo

AdvancedLevel_C++/1070. Mooncake (25).cpp

@@ -3,7 +3,7 @@
 #include <vector>
 using namespace std;
 struct mooncake{
-    float mount, price, unit;
+    float num, price, unit;
 };
 int cmp(mooncake a, mooncake b) {
     return a.unit > b.unit;
@@ -12,19 +12,19 @@ int main() {
     int n, need;
     cin >> n >> need;
     vector<mooncake> a(n);
-    for (int i = 0; i < n; i++) scanf("%f", &a[i].mount);
+    for (int i = 0; i < n; i++) scanf("%f", &a[i].num);
     for (int i = 0; i < n; i++) scanf("%f", &a[i].price);
-    for (int i = 0; i < n; i++) a[i].unit = a[i].price / a[i].mount;
+    for (int i = 0; i < n; i++) a[i].unit = a[i].price / a[i].num;
     sort(a.begin(), a.end(), cmp);
     float result = 0.0;
     for (int i = 0; i < n; i++) {
-        if (a[i].mount <= need) {
+        if (a[i].num <= need) {
             result = result + a[i].price;
         } else {
             result = result + a[i].unit * need;
             break;
         }
-        need = need - a[i].mount;
+        need = need - a[i].num;
     }
     printf("%.2f",result);
     return 0;

BasicLevel_C++/1020. 月饼 (25).cpp

@@ -3,7 +3,7 @@
 #include <vector>
 using namespace std;
 struct mooncake{
-    float mount, price, unit;
+    float num, price, unit;
 };
 int cmp(mooncake a, mooncake b) {
     return a.unit > b.unit;
@@ -12,19 +12,19 @@ int main() {
     int n, need;
     cin >> n >> need;
     vector<mooncake> a(n);
-    for (int i = 0; i < n; i++) scanf("%f", &a[i].mount);
+    for (int i = 0; i < n; i++) scanf("%f", &a[i].num);
     for (int i = 0; i < n; i++) scanf("%f", &a[i].price);
-    for (int i = 0; i < n; i++) a[i].unit = a[i].price / a[i].mount;
+    for (int i = 0; i < n; i++) a[i].unit = a[i].price / a[i].num;
     sort(a.begin(), a.end(), cmp);
     float result = 0.0;
     for (int i = 0; i < n; i++) {
-        if (a[i].mount <= need) {
+        if (a[i].num <= need) {
             result = result + a[i].price;
         } else {
             result = result + a[i].unit * need;
             break;
         }
-        need = need - a[i].mount;
+        need = need - a[i].num;
     }
     printf("%.2f",result);
     return 0;

BasicLevel_C++/1092. 最好吃的月饼 (20).cpp

@@ -1,15 +1,15 @@
 #include <iostream>
 #include <vector>
 using namespace std;
-int a[1005][105], sum[1005];
+int sum[1005];
 int main() {
-    int m, n, maxn = 0, total = 0;
+    int m, n, temp, maxn = 0;
     vector<int> ans;
     cin >> m >> n;
     for (int i = 1; i <= n; i++) {
         for (int j = 1; j <= m; j++) {
-            cin >> a[i][j];
-            sum[j] += a[i][j];
+            cin >> temp;
+            sum[j] += temp;
             maxn = max(maxn, sum[j]);
         }
     }

CCCC-GPLT/L2-003. 月饼 .cpp

@@ -3,7 +3,7 @@
 #include <vector>
 using namespace std;
 struct mooncake{
-    float mount, price, unit;
+    float num, price, unit;
 };
 int cmp(mooncake a, mooncake b) {
     return a.unit > b.unit;
@@ -12,19 +12,19 @@ int main() {
     int n, need;
     cin >> n >> need;
     vector<mooncake> a(n);
-    for (int i = 0; i < n; i++) scanf("%f", &a[i].mount);
+    for (int i = 0; i < n; i++) scanf("%f", &a[i].num);
     for (int i = 0; i < n; i++) scanf("%f", &a[i].price);
-    for (int i = 0; i < n; i++) a[i].unit = a[i].price / a[i].mount;
+    for (int i = 0; i < n; i++) a[i].unit = a[i].price / a[i].num;
     sort(a.begin(), a.end(), cmp);
     float result = 0.0;
     for (int i = 0; i < n; i++) {
-        if (a[i].mount <= need) {
+        if (a[i].num <= need) {
             result = result + a[i].price;
         } else {
             result = result + a[i].unit * need;
             break;
         }
-        need = need - a[i].mount;
+        need = need - a[i].num;
     }
     printf("%.2f",result);
     return 0;