Submission #48119673

---

Source Code Expand

#include <bits/stdc++.h>
using namespace std;

typedef long long ll;

#define rep(i,n) for(ll i=0;i<n;++i)
#define rrep(i,n) for(ll i=n-1;i>=0;--i)
#define FOR(i,s,e) for(ll i=s;i<=e;++i)
#define FFOR(i,s,e) for(ll i=s;i>=e;--i)

#define yesno(flg) if(flg){cout<<"Yes"<<endl;}else{cout<<"No"<<endl;}
#define ALL(a) (a).begin(),(a).end()
#define mp make_pair
#define pb push_back
#define vl vector<ll>
#define vs vector<string>
#define so(a) sort(a.begin(),a.end())

#define fi first
#define se second
#define print(a) cout<<a<<endl
#define ssize(a) (ll)(a.size())

#define MAX_N 1002
#define i197 1000000007
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return 1; } return 0; }

typedef pair<int,int> Pi;
typedef pair<ll, ll> P2;
typedef pair<P2,ll> P3;
typedef pair<P2,P2> P4;

const ll INF=1000000000000000001;


int main(){

	ios::sync_with_stdio(0);
	cin.tie(0);

	ll n,m,l;
	cin>>n>>m>>l;

	vl a(n);
	vl b(m);

	vector<vl> v(n);

	rep(i,n)cin>>a[i];
	rep(i,m)cin>>b[i];

	vector<P2> t(l);
	vl c(l),d(l);
	rep(i,l){
		cin>>c[i]>>d[i];
		t[i]=P2(a[c[i]-1]+b[d[i]-1],i);
	}
	so(t);
	vector<P2> b2(m);
	rep(i,m)b2[i]=P2(b[i],i);
	so(b2);

	rrep(i,l){
		ll s=t[i].se;
		v[c[s]-1].pb(d[s]-1);
	}

	ll ans=0;
	rep(i,n){
		ll z=0;

		rrep(j,m){
			ll s=b2[j].se;
			if(z==ssize(v[i]) || v[i][z]!=s){
				chmax(ans,b2[j].fi+a[i]);
				break;
			}
			z++;
		}

	}
	print(ans);


	return 0;
}

Submission Info

Judge Result