結果
問題 | No.615 集合に分けよう |
ユーザー | butsurizuki |
提出日時 | 2017-12-15 21:35:14 |
言語 | C90 (gcc 11.4.0) |
結果 |
AC
|
実行時間 | 22 ms / 2,000 ms |
コード長 | 3,016 bytes |
コンパイル時間 | 1,152 ms |
コンパイル使用メモリ | 26,504 KB |
実行使用メモリ | 4,736 KB |
最終ジャッジ日時 | 2023-08-21 06:49:00 |
合計ジャッジ時間 | 2,844 ms |
ジャッジサーバーID (参考情報) |
judge15 / judge11 |
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 1 ms
4,380 KB |
testcase_01 | AC | 1 ms
4,376 KB |
testcase_02 | AC | 1 ms
4,380 KB |
testcase_03 | AC | 1 ms
4,380 KB |
testcase_04 | AC | 1 ms
4,380 KB |
testcase_05 | AC | 1 ms
4,376 KB |
testcase_06 | AC | 1 ms
4,380 KB |
testcase_07 | AC | 1 ms
4,380 KB |
testcase_08 | AC | 1 ms
4,380 KB |
testcase_09 | AC | 1 ms
4,376 KB |
testcase_10 | AC | 1 ms
4,380 KB |
testcase_11 | AC | 1 ms
4,380 KB |
testcase_12 | AC | 1 ms
4,376 KB |
testcase_13 | AC | 1 ms
4,376 KB |
testcase_14 | AC | 1 ms
4,380 KB |
testcase_15 | AC | 5 ms
4,376 KB |
testcase_16 | AC | 22 ms
4,628 KB |
testcase_17 | AC | 22 ms
4,632 KB |
testcase_18 | AC | 22 ms
4,736 KB |
testcase_19 | AC | 22 ms
4,628 KB |
testcase_20 | AC | 22 ms
4,628 KB |
testcase_21 | AC | 22 ms
4,696 KB |
testcase_22 | AC | 22 ms
4,596 KB |
testcase_23 | AC | 14 ms
4,640 KB |
testcase_24 | AC | 21 ms
4,680 KB |
testcase_25 | AC | 1 ms
4,380 KB |
testcase_26 | AC | 1 ms
4,380 KB |
testcase_27 | AC | 9 ms
4,488 KB |
testcase_28 | AC | 8 ms
4,440 KB |
testcase_29 | AC | 12 ms
4,544 KB |
testcase_30 | AC | 12 ms
4,436 KB |
コンパイルメッセージ
main.c:14:5: warning: conflicting types for built-in function ‘round’ [-Wbuiltin-declaration-mismatch] int round(int a,int b){if((a%b)*2 >= b){return (a/b)+1;}return a/b;} ^~~~~ main.c:15:5: warning: conflicting types for built-in function ‘ceil’ [-Wbuiltin-declaration-mismatch] int ceil(int a,int b){if(a%b==0){return a/b;}return (a/b)+1;} ^~~~ main.c:20:5: warning: conflicting types for built-in function ‘pow’ [-Wbuiltin-declaration-mismatch] int pow(int a,int b){int i,r=1;for(i=1;i<=b;i++){r*=a;}return r;} ^~~ main.c:24:11: warning: conflicting types for built-in function ‘llround’ [-Wbuiltin-declaration-mismatch] long long llround(long long a,long long b){if((a%b)*2 >= b){return (a/b)+1;}return a/b;} ^~~~~~~
ソースコード
//set many funcs template #include<stdio.h> #include<string.h> #include<stdlib.h> #include<stdbool.h> #define inf 1072114514 #define llinf 4154118101919364364 #define mod 1000000007 #define pi 3.1415926535897932384 int max(int a,int b){if(a>b){return a;}return b;} int min(int a,int b){if(a<b){return a;}return b;} int zt(int a,int b){return max(a,b)-min(a,b);} int round(int a,int b){if((a%b)*2 >= b){return (a/b)+1;}return a/b;} int ceil(int a,int b){if(a%b==0){return a/b;}return (a/b)+1;} int gcd(int a,int b){int c;while(b!=0){c=a%b;a=b;b=c;}return a;} int lcm(int a,int b){int c=gcd(a,b);a/=c;return a*b;} int nCr(int a,int b){int i,r=1;for(i=1;i<=b;i++){r*=(a+1-i);r/=i;}return r;} int fact(int a){int i,r=1;for(i=1;i<=a;i++){r*=i;}return r;} int pow(int a,int b){int i,r=1;for(i=1;i<=b;i++){r*=a;}return r;} long long llmax(long long a,long long b){if(a>b){return a;}return b;} long long llmin(long long a,long long b){if(a<b){return a;}return b;} long long llzt(long long a,long long b){return llmax(a,b)-llmin(a,b);} long long llround(long long a,long long b){if((a%b)*2 >= b){return (a/b)+1;}return a/b;} long long llceil(long long a,long long b){if(a%b==0){return a/b;}return (a/b)+1;} long long llgcd(long long a,long long b){long long c;while(b!=0){c=a%b;a=b;b=c;}return a;} long long lllcm(long long a,long long b){long long c=llgcd(a,b);a/=c;return a*b;} long long llnCr(long long a,long long b){long long i,r=1;for(i=1;i<=b;i++){r*=(a+1-i);r/=i;}return r;} long long llfact(long long a){long long i,r=1;for(i=1;i<=a;i++){r*=i;}return r;} long long llpow(long long a,long long b){long long i,r=1;for(i=1;i<=b;i++){r*=a;}return r;} double dbmax(double a,double b){if(a>b){return a;}return b;} double dbmin(double a,double b){if(a<b){return a;}return b;} double dbzt(double a,double b){return dbmax(a,b)-dbmin(a,b);} int sortfncsj(const void *a,const void *b){if(*(int *)a>*(int *)b){return 1;}if(*(int *)a==*(int *)b){return 0;}return -1;} int sortfnckj(const void *a,const void *b){if(*(int *)a<*(int *)b){return 1;}if(*(int *)a==*(int *)b){return 0;}return -1;} int llsortfncsj(const void *a,const void *b){if(*(long long *)a>*(long long *)b){return 1;}if(*(long long *)a==*(long long *)b){return 0;}return -1;} int llsortfnckj(const void *a,const void *b){if(*(long long *)a<*(long long *)b){return 1;}if(*(long long *)a==*(long long *)b){return 0;}return -1;} int dbsortfncsj(const void *a,const void *b){if(*(double *)a>*(double *)b){return 1;}if(*(double *)a==*(double *)b){return 0;}return -1;} int dbsortfnckj(const void *a,const void *b){if(*(double *)a<*(double *)b){return 1;}if(*(double *)a==*(double *)b){return 0;}return -1;} int main(void){ long long i,j,n,k,a[262144],b[262144],r=0; scanf("%lld%lld",&n,&k); for(i=0;i<n;i++){scanf("%lld",&a[i]);} qsort(a,n,sizeof(long long),llsortfncsj); for(i=0;i<n-1;i++){ b[i]=a[i+1]-a[i]; } qsort(b,n-1,sizeof(long long),llsortfncsj); for(i=0;i<(n-k);i++){r+=b[i];} printf("%lld\n",r); return 0; }