제출 #149068

#	제출 시각UTC-0	아이디	문제	언어	결과	실행 시간	메모리
149068	2019-09-01 05:40:25	=SUM(D1:D9) (#200)	십자가 놓기 (FXCUP4_cross)	C++17	100 / 100	240 ms	14428 KiB

cross

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
#include "cross.h"
#include<vector>
#include<set>
#include<algorithm>
using namespace std;
multiset<long long> S; // keep as size K
vector<pair<int,int>> cross;
long long SelectCross(int K, std::vector<int> I, std::vector<int> O) {
  int N = I.size();
  for(int i=0;i<N;++i){
    cross.push_back({I[i],O[i]});
  }
  sort(cross.begin(),cross.end(),[](auto x,auto y){return x.first>y.first;});
  long long mx=0;
  for(int i=0;i<N;++i){
    long long mi = cross[i].first;
    // put the O in the set
    S.insert(cross[i].second);
    // keep the size(evict the smallest o)
    if((int)S.size()>K) S.erase(S.begin());
    if((int)S.size()<K) continue;
    // get the smallest element
    long long statQuo = (int)(*S.begin());
    // update maxma
    if(mx < 2 * statQuo * mi - mi * mi){
      mx = 2 * statQuo * mi - mi * mi;
    }
  }
  return mx;
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

• Subtask 1: 8 / 8
• Subtask 2: 55 / 55
• Subtask 3: 37 / 37