Codeforces Round #264 (Div. 2) 463A Caisa and Sugar

来源：互联网发布：淘宝充值到空号怎么办编辑：程序博客网时间：2024/04/30 15:25

这个题的题意不好理解，题目的意思是：有s美元，和n种糖，用这s美元去买一种糖，并且只买一个，如果s美元不能买到任何一种糖，则输出-1，否则，计算买糖时需要找的零钱，输出最大的零钱数；

#include<cstdio>#include<cstring>#include<cmath>#include<climits>#include<cctype>#include<cstdlib>#include<iostream>#include<algorithm>#include<queue>#include<vector>#include<map>#include<set>#include<string>#include<stack>#define ll __int64#define MAX 1000#define eps 1e-8#define INF INT_MAXusing namespace std;int main(){     int n,s; while (scanf("%d%d",&n,&s) != EOF){ int x,y,ok  = 0; int ans = 0; s = s * 100; for (int i = 0; i<n; i++){ scanf("%d%d",&x,&y); int t = x*100 + y; if (s >= t){ ok = 1; ans = max(ans,(s - t) % 100); } } if (!ok) printf("-1\n");else printf("%d\n",ans); } return 0;}

0 0