fork(1) download
copy 
  1. //
  2. //  main.c
  3. //  NUMBERS
  4. //
  5. //  Created by Dhruv Mullick on 24/11/13.
  6. //  Copyright (c) 2013 Dhruv Mullick. All rights reserved.
  7. //
  8.  
  9. #include <stdio.h>
  10. #include <string.h>
  11.  
  12. struct p
  13. {
  14.     long long int A;
  15.     char name[6];
  16. };
  17.  
  18. void sort(struct p player[],int ibegin,int iend, struct p temp[]);
  19. void merge(struct p player[],int ibegin,int imid,int iend,struct p temp[]);
  20.  
  21. int main(void)
  22. {
  23.     int n,i,c;
  24.     long long int t;
  25.     scanf("%d",&c);
  26.  
  27.     while(c--)
  28.     {
  29.         scanf("%d",&n);
  30.         struct p player[n];
  31.         struct p temp[n];
  32.  
  33.         for(i=0;i<n;i++)
  34.         {
  35.             fgets(player[i].name, 6, stdin);
  36.             getchar();
  37.             scanf("%lld", &player[i].A);
  38.         }
  39.  
  40.         sort(player,0,n,temp);
  41.  
  42.         //For checking purpose only. String isn't getting printed.
  43.         for(i=0;i<n;i++)
  44.         {
  45.             printf("%s", player[i].name);
  46.             //fputs(player[i].name,stdout);
  47.  
  48.             printf("%lld\n", player[i].A);
  49.         }
  50.  
  51.         for(i=0;i<n;i++)
  52.         {
  53.             t=player[i].A;
  54.  
  55.             while((i+1)!=n && player[i+1].A==t)
  56.             {
  57.                 i++;
  58.             }
  59.  
  60.             if(player[i].A==t)
  61.             {
  62.                 fputs(player[i].name,stdout);
  63.                 printf("%lld\n", player[i].A);
  64.                 break;
  65.             }
  66.         }
  67.  
  68.         if(i==n)
  69.         {
  70.             printf("Nobody wins.\n");
  71.         }
  72.  
  73.  
  74.     }
  75.  
  76.     return 0;
  77. }
  78.  
  79. void merge(struct p player[],int ibegin,int imid,int iend,struct p temp[])
  80. {
  81.     int a0, a1,j;
  82.     j = ibegin;
  83.     a0 = ibegin;
  84.     a1 = imid;
  85.  
  86.     while(j<iend)
  87.     {
  88.         if(a0<imid && ((a1>iend) || (player[a0].A < player[a1].A)))
  89.         {
  90.             temp[j].A = player[a0].A;
  91.             strcpy(temp[j].name, player[a0].name);
  92.             a0++;
  93.             j++;
  94.         }
  95.  
  96.         else
  97.         {
  98.             temp[j].A = player[a1].A;
  99.             strcpy(temp[j].name, player[a1].name);
  100.             a1++;
  101.             j++;
  102.         }
  103.     }
  104. }
  105.  
  106. void sort(struct p player[],int ibegin,int iend,struct p temp[])
  107. {
  108.     int i;
  109.  
  110.     if((iend - ibegin)==1)
  111.         return;
  112.  
  113.     int imid = (iend + ibegin)/2;
  114.  
  115.     sort(player, ibegin, imid, temp);
  116.     sort(player, imid, iend, temp);
  117.  
  118.     merge(player, ibegin, imid, iend, temp);
  119.  
  120.     for(i=ibegin;i<=iend;i++)
  121.     {
  122.         player[i] = temp[i];
  123.     }
  124.  
  125. }
  126.  
Success #stdin #stdout 0s 2252KB
comments ()
stdin
copy 
1
3
a
1
b
3
c
2
stdout
copy 
1

2
����a�_��KW�(v�rﭿ-4634814004864972064

1
https://ideone.com/IXMS7v
language:
C (gcc 8.3)
created:
11 years ago
visibility:
public

Share or Embed source code

Discover > Sphere Engine API

The brand new service which powers Ideone!

Discover > IDE Widget

Widget for compiling and running the source code in a web browser!