题解 | #合并表记录#

#include <stdio.h>
#include <string.h>

#define max 1000

//2021/7/3-15:40
//2021/7/3-16:00



int main()
{
   int i = 0, j, n, k, v;

   int key[max];
   int val[max];

   scanf("%d", &n);//get number

   while (scanf("%d %d", &k, &v) != EOF)
   {
      for (j = 0; j < i; j++)//check duplicate
      {
         if (k == key[j])
         {
            val[j] += v;
            break;
         }
      }
      if (j >= i)
      {
         key[i] = k;
         val[i] = v;
         i++;
      }
   }

   //print
   while (i > 0)
   {
      for (j = 0, k = key[0], n = 0; j < i; j++)
      {
         if (key[j] < k)
         {
            k = key[j];
            n = j;
         }
      }

      printf("%d %d\n", key[n], val[n]);
      key[n] = key[i - 1];
      val[n] = val[i - 1];
      i--;
   }


   return 0;
}