# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
149470 | 2019-09-01T06:33:39 Z | 요까할 로뭘 은명팀(#3558, mario05092929, foja001, earthk) | Crosses on the Grid (FXCUP4_cross) | C++17 | 5 ms | 384 KB |
#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.second == p2.second) return p1.first > p2.first; else return p1.second > p2.second; } 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,ans = 0; for(int i = 0;i < k;i++) { //ans = max(ans,v[i].first*(v[i].first-2)+2*v[i].second); ii = min(ii,v[i].first); oo = min(oo,v[i].second); } return oo*(oo-2)+2*ii; }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 5 ms | 384 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 5 ms | 384 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 5 ms | 384 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |