제출 #154194

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
154194		AKaan37	Potatoes and fertilizers (LMIO19_bulves)	C++17	24 / 100	170 ms	18976 KiB

bulves

//Sani buyuk Osman Pasa Plevneden cikmam diyor.
//FatihSultanMehmedHan
//Abdulhamid Han
//Bismillahirrahmanirrahim
//█▀█─█──█──█▀█─█─█
//█▄█─█──█──█▄█─█▄█
//█─█─█▄─█▄─█─█─█─█

#pragma GCC optimize ("O3")
#pragma GCC target ("sse4")

#include <bits/stdc++.h>

using namespace std;

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

#define fi first
#define se second
#define int long long
#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 = 1000005;
const lo mod = 1000000007;

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

main(void){
	scanf("%lld",&n);
	FOR{
		scanf("%lld %lld",&a[i],&b[i]);
		if(a[i]>b[i])
			v.pb(mp(i,abs(a[i]-b[i])));
		else if(a[i]<b[i])
			vv.pb(mp(i,abs(a[i]-b[i])));
	}
	//~ at=0;
	int bb=0;
	int ii=0;
	sort(v.begin(),v.end());
	sort(vv.begin(),vv.end());
	while(ii<(int)vv.size()){
		int at=min(v[bb].se,vv[ii].se);
		cev+=abs(vv[ii].fi-v[bb].fi)*at;
		v[bb].se-=at;
		vv[ii].se-=at;
		if(vv[ii].se==0)ii++;
		if(v[bb].se==0)bb++;
	}
	printf("%lld\n",cev);
	return 0;
}

컴파일 시 표준 에러 (stderr) 메시지

bulves.cpp:43:10: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
 main(void){
          ^
bulves.cpp: In function 'int main()':
bulves.cpp:44:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%lld",&n);
  ~~~~~^~~~~~~~~~~
bulves.cpp:46:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf("%lld %lld",&a[i],&b[i]);
   ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~

• Subtask 1: 24 / 24
• Subtask 2: 0 / 10
• Subtask 3: 0 / 20
• Subtask 4: 0 / 10
• Subtask 5: 0 / 36