Spoj/ANARC05B.cpp at master · ayushmnnit/Spoj · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
#include<iostream>
#include<stdio.h>
#include<vector>

using namespace std;

int binary_search(int a[],int n,int x)
{
    int beg=0;
    int end=n-1;

    while(beg<=end)
    {
                  int mid=(beg+end)/2;

                  if(x==a[mid])
                  return mid;

                  else if(x<a[mid])
                  end=mid-1;

                  else
                  beg=mid+1;
    }

    return -1;
}

int main()
{
    while(true)
    {
               int m,n;

               scanf("%d",&m);

               if(m==0)
               break;

               int a[10000],b[10000];

               for(int i=0;i<m;i++)
               cin>>a[i];

               scanf("%d",&n);

               for(int j=0;j<n;j++)
               cin>>b[j];


               vector<int> v;
               vector<int> v1;

               int p=0;
               int sum=0;
               int sum2=0;

               for(int i=0;i<m;i++)
               {
                       int loc=binary_search(b,n,a[i]);

                       if(loc==-1)
                       sum=sum+a[i];

                       else
                       {
                           sum=sum+a[i];
                           v.push_back(sum);

                           while(p<=loc)
                           sum2=sum2+b[p],p++;

                           v1.push_back(sum2);
                           sum=0;
                           sum2=0;
                       }

               }

               while(p<n)
               sum2=sum2+b[p++];

               v1.push_back(sum2);
               v.push_back(sum);

              /* for(int i=0;i<v.size();i++)
               cout<<v[i]<<" ";

               for(int i=0;i<v1.size();i++)
               cout<<v1[i]<<" ";*/

             int ans=0;

               for(int i=0;i<v.size();i++)
               {
                       if(v[i]>v1[i])
                       ans=ans+v[i];

                       else
                       ans=ans+v1[i];

               }

               cout<<ans<<endl;

    }

    system ("pause");

    return 0;

}