#include "cross.h"
#include <bits/stdc++.h>
#define pll pair<long long,long long>
using namespace std;
typedef long long ll;
vector <pll> v;
int n;
bool cmp(pll p1,pll p2)
{
if(p1.first == p2.first) return p1.second > p2.second;
else return p1.first > p2.first;
}
long long SelectCross(int k,vector<int> I,vector<int> O) {
n = I.size();
for(int i = 0;i < n;i++) v.push_back(make_pair((ll)I[i],(ll)O[i]));
sort(v.begin(),v.end(),cmp);
ll oo = 1e10,ii = 1e10;
for(int i = 0;i < k;i++)
{
oo = min(oo,v[i].first);
ii = min(ii,v[i].second);
}
return oo*(oo-2)+2*ii;
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Incorrect |
5 ms |
384 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Incorrect |
5 ms |
384 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Incorrect |
5 ms |
384 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |