Submission #149258

#	Time	Username	Problem	Language	Result	Execution time	Memory
149258		샌즈뼈 (#200)	Crosses on the Grid (FXCUP4_cross)	C++17	0 / 100	6 ms	384 KiB

cross

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

long long SelectCross(int K, std::vector<int> I, std::vector<int> O) {
	int N = I.size();

  vector<pair<int, int>> v;
  for(int i=0; i<N; i++) v.emplace_back(I[i], O[i]);

  sort(v.rbegin(), v.rend());

  //for(int i=0;i <N; i++) cout << v[i].first << ' '; cout << endl;
  //for(int i=0;i <N; i++) cout << v[i].second << ' '; cout << endl;


  priority_queue<int, vector<int>, greater<int>> s;
  for(int i=0; i<K-1; i++) {
    s.push(v[i].second);
  }

  long long res = 0;
  for(int i=K-1; i<N; i++) {
    int ii = v[i].first;
    int oo = s.size() ? min(s.top(), v[i].second) : v[i].second;

    // cout << oo << ' ' << ii << endl;

    res = max(res, 1LL*oo*oo - 1LL*(oo-ii)*(oo-ii));

    if((int)s.size() > K-1) s.pop();
    s.push(v[i].second);
  }

	return res;
}

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