제출 #157075

#제출 시각아이디문제언어결과실행 시간메모리
157075AKaan37전선 연결 (IOI17_wiring)C++17
0 / 100
2 ms376 KiB
//Sani buyuk Osman Pasa Plevneden cikmam diyor.
//FatihSultanMehmedHan
//Abdulhamid Han
//Bismillahirrahmanirrahim
//█▀█─█──█──█▀█─█─█
//█▄█─█──█──█▄█─█▄█
//█─█─█▄─█▄─█─█─█─█
#include "wiring.h"
#pragma GCC optimize ("O3")
#pragma GCC target ("sse4")

#include <cassert>
#include <cstdio>
#include <bits/stdc++.h>
 
using namespace std;

typedef long long lo;
typedef pair< lo,lo > PII;

#define fi first
#define se second
#define mp make_pair
#define pb push_back
#define fio() ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL)
#define FOR for(int i=1;i<=n;i++)
#define mid ((start+end)/2)
#define ort ((bas+son)/2)

const lo MAX = -1000000000000000000;
const lo MIN = 1000000000000000000;
const lo inf = 1000000000;
const lo KOK = 100000;
const lo LOG = 30;
const lo li = 500005;
const lo mod = 1000000007;

int n,m,b[li],a[li],k,flag,t;
int cev;
queue<int> q;
string s;
vector<PII> v;

long long min_total_length(std::vector<int> r, std::vector<int> b) {
	for(int i=0;i<(int)r.size();i++){q.push(r[i]);v.pb(mp(r[i],1));}
	for(int i=0;i<(int)b.size();i++){v.pb(mp(b[i],2));cev+=b[i]-q.front();q.pop();}
	sort(v.begin(),v.end());
	FOR{
	}
	return 0;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...