Cinema Page33 离散化

Cinema Page33 离散化

离散化都忘光了，是个很有用的东西，从基础开始学一下

读入的时候没有看清楚把bc两个数组一起读了，一直没发现，以为离散化写错了

vector去重也不会了

sort(V.begin(),V.end());
V.erase(unique(V.begin(),V.end()),V.end());

代码：

#pragma GCC optimize(1)
#pragma GCC optimize(2)
#pragma GCC optimize(3,"Ofast","inline")
#include<cstdio>
#include<cstring>
#include<algorithm>
#include<iostream>
#include<string>
#include<vector>
#include<stack>
#include<bitset>
#include<cstdlib>
#include<cmath>
#include<set>
#include<list>
#include<deque>
#include<queue>
#include<map>
#define ll long long
#define pb push_back
#define rep(x,a,b) for (int x=a;x<=b;x++)
#define repp(x,a,b) for (int x=a;x<b;x++)
#define W(x) printf("%d\n",x)
#define WW(x) printf("%lld\n",x)
#define pi 3.14159265358979323846
#define mem(a,x) memset(a,x,sizeof a)
#define lson rt<<1,l,mid
#define rson rt<<1|1,mid+1,r
using namespace std;
const int maxn=2e6+7;
const int INF=1e9;
const ll INFF=1e18;
int n,m,a[maxn],b[maxn],c[maxn],tol=0,d[maxn],num[maxn];
vector<int> V;
int query(int x)
{
    return lower_bound(d+1,d+1+tol,x)-d;
}
struct node
{
    int x,y,id;
}p[maxn];
bool cmp(node a,node b)
{
    if (a.x==b.x)return a.y>b.y;
    else return a.x>b.x;
}
int main()
{
    scanf("%d",&n);
    rep(i,1,n)scanf("%d",&a[i]),V.pb(a[i]);
    scanf("%d",&m);
    rep(i,1,m)scanf("%d",&b[i]),V.pb(b[i]);
    rep(i,1,m)scanf("%d",&c[i]),V.pb(c[i]);
    sort(V.begin(),V.end());
    V.erase(unique(V.begin(),V.end()),V.end());
    repp(i,0,V.size())d[++tol]=V[i];
    rep(i,1,n)num[query(a[i])]++;
    rep(i,1,m)
    {
        p[i].x=num[query(b[i])];
        p[i].y=num[query(c[i])];
        p[i].id=i;
    }
    sort(p+1,p+1+m,cmp);
    W(p[1].id);
    return 0;
}