| Run ID | Author | Problem | Lang | Verdict | Score | Time | Memory | Code Length | Submit Time |
|---|---|---|---|---|---|---|---|---|---|
| 15442 | 陈颖钧 | 最满意的方案 | C++ | Time Limit Exceeded | 50 | 1000 MS | 1040 KB | 355 | 2026-02-01 15:57:19 |
#include<bits/stdc++.h> using namespace std; int n,m,i,j,s,ma,t; int main(){ cin>>n>>m; int a[n],b[m]; for(i=1;i<=n;i++){ scanf("%d",&a[i]); } for(i=1;i<=m;i++){ scanf("%d",&b[i]); ma=1000000; for(j=1;j<=n;j++){ t=b[i]-a[j]; if(t<0){ t*=-1; } if(ma>t){ ma=t; } } s+=ma; } printf("%d",s); }