树分治 (线段树维护区间前k大)

原题地址:http://csustacm.com:4803/problem/1015

思路:由于k很小,所以每次用线段树维护前k大的数字就行了.

 

#include <bits/stdc++.h>
#include <cmath>
#define eps 1e-8
#define INF 0x3f3f3f3f
#define PI acos(-1)
#define lson l,mid,rt<<1
#define rson mid+1,r,rt<<1|1
#define CLR(x,y) memset((x),y,sizeof(x))
#define fuck(x) cout<<"["<<"x = "<<(x)<<"] "
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
const int seed = 131;
const int maxn = 5e5 + 5;
const int mod = 998244353;

int n, m, k;
//bool cmp(int a,int b) {
//return a>b;
//}
struct node {
    int v[5];