关于%lld和%I64d的问题

#include <queue>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <algorithm>

using namespace std;

typedef long long LL;

const int maxn = 1e7+10;
const int mod = 1e9;

priority_queue <int> q;

int n,m,x,y;
long long ans,calc;
int num[maxn];

int main() {
	freopen("shop.in","r",stdin);
	freopen("shop.out","w",stdout);
	scanf("%d%d",&n,&m);
	scanf("%d%d",&x,&y);
	num[1]=x;
	for (int i=2; i<=n; i++) {
		calc=((LL)y*(LL)num[i-1]+(LL)x)%mod;
		num[i]=(int)calc;
	}
	for (int i=1; i<=m; i++) {
		q.push(num[i]);
		ans+=num[i];
	}
	for (int i=m+1; i<=n; i++) {
		if (q.top()>num[i]) {
			ans-=q.top();
			ans+=num[i];
			q.pop();
			q.push(num[i]);
		}
	}
	printf("%lld\n",ans);
	return 0;
}